- 博客(6)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 随机优化快速排序
#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
415
原创 快排
#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
305
原创 归并排序
#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
329
原创 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
369
原创 插入排序
#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
264
原创 堆排
#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
383
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人