easycpp.com
域名年龄: 12年2个月2天HTTP/1.1 301 永久重定向 访问时间:2013年10月27日 04:55:30 X-Pingback: http://www.easycpp.com/xmlrpc.php 语言环境:PHP/5.2.17 目标网址:http://www.easycpp.com/ Keep-Alive: timeout=5, max=100 连接:Keep-Alive Transfer-Encoding: chunked 类型:text/html; charset=UTF-8 HTTP/1.1 200 OK 访问时间:2013年10月27日 04:55:30 X-Pingback: http://www.easycpp.com/xmlrpc.php 语言环境:PHP/5.2.17 Keep-Alive: timeout=5, max=100 连接:Keep-Alive Transfer-Encoding: chunked 类型:text/html; charset=UTF-8 网站编码:UTF-8
Toggle navigation
Toggle search
easycpp
Menu
Skip to content
Home
Search:
easycpp
About data structure and algorithm
Quick Sort C++
Posted on October 18, 2013 by fox64194167
Below is the core code template <class T> int Partition(T a[], int p, int r){ int x = a[r]; int i = p – 1; for(int j = p;j <= r – 1;j++){ if(a[j] <= x){ i++; swap(a[i],a[j]); } } swap(a[i + 1],a[r]); return i + 1; } Figure below show how Partition works on […]
Continue reading
Inserting Sort C++
Posted on October 18, 2013 by fox64194167
Since an array with one element is a sorted array. By insert second element into this one array, we get a sorted array of size 2, Continuing in this way, we obtain a sorted array of size n. // InsertionSort.cpp : Defines the entry point for the console application. // #include "stdafx.h" #include <iostream> […]
Continue reading
Bubble Sort C++
Posted on October 18, 2013 by fox64194167
“Bubble Sort” is a simple way to sort elements. This sort employs a “bubbling strategy” to get the largetest element to the right. In a bubbling pass, pairs of adjacent elements are compared, the elements are swapped in case the one on the left is greater than the one on the right. At the end […]
Continue reading
Search:
Recent Posts
Quick Sort C++
Inserting Sort C++
Bubble Sort C++
Recent CommentsArchives
October 2013
Categories
data structure and algorithm
Meta
Log in
Entries RSS
Comments RSS
WordPress.org
© 2013 easycpp -
Powered by WordPress
-
Melany theme by deshack
© 2010 - 2020 网站综合信息查询 同IP网站查询 相关类似网站查询 网站备案查询网站地图 最新查询 最近更新 优秀网站 热门网站 全部网站 同IP查询 备案查询
2025-12-16 21:12, Process in 0.0035 second.