algorithm
秦慎强
IT菜鸟
展开
-
插入排序
#include #define maxn 10000void Insertion_Sort(int A[], int n){ int i, j, key; for (j = 2; j key = A[j]; for (i = j - 1; i > 0&&A[i] > key; i--) A[i + 1] = A[i]; A[i + 1] = key;原创 2013-06-26 09:39:19 · 260 阅读 · 0 评论 -
快排
#include #include #define maxn 10000void swap(int *i, int *j){ int t; t = *i; *i = *j; *j = t;}int Partition(int A[], int p, int r){ int i, j, x; x = A[r]; i = p - 1; for(j =原创 2013-06-26 09:40:54 · 304 阅读 · 0 评论 -
K小数
#include #include #include #define maxn 10000void swap(int *i, int *j){ int t; t = *i; *i = *j; *j = t;}int Partition(int A[], int p, int r){ int i, j, x; x = A[r]; i = p - 1原创 2013-06-26 09:39:59 · 365 阅读 · 0 评论 -
堆排
#include #include #define maxn 10000int Parent(int i){ return i / 2;}int Left(int i){ return 2 * i;}int Right(int i){ return 2 * i + 1;}void swap(int *i, int *j){ int t; t原创 2013-06-26 09:38:15 · 377 阅读 · 0 评论 -
归并排序
#include #include #define INF 1#define maxn 10000void Merge(int A[], int p, int q, int r){ int n1, n2, i, j, k; int L[maxn + 1], R[maxn + 1]; n1 = q - p + 1; n2 = r - q; for (i = 1;原创 2013-06-26 09:40:25 · 327 阅读 · 0 评论 -
随机优化快速排序
#include #include #include #define maxn 10000void swap(int *i, int *j){ int t; t = *i; *i = *j; *j = t;}int Partition(int A[], int p, int r){ int i, j, x; x = A[r]; i = p - 1原创 2013-06-26 09:41:38 · 410 阅读 · 0 评论