sort
各种排序算法，下标都从1开始。sort_test.c是用来测试的。
void heap_sort(int *array,int size)
void create_min_heap(int *array,int size)
void adjust_min_heap(int *array,int start,int size)
void bubble_sort(int *array,int size)
void select_sort(int *array,int size)
void quick_sort(int *array,int size)
void unrec_quick_sort(int *array, int size)
void insert_sort(int *array,int low,int high)
int bucket_sort(int *array,int size,int max_value)
int max_k_heap(int *array,int size,int k,int *k_array)
int max_k_select(int *array,int size,int k,int *k_array)
void find_max_min(int *array,int size,int *max,int *min)
int find_max_k(int *array,int low,int high,int k) (Some sort functions."sort_test.c" is used to test.
void heap_sort(int*array,int size)
void create_min_heap(int*array,int size)
void adjust_min_heap(int*array,int start,int size)
void bubble_sort(int*array,int size)
void select_sort(int*array,int size)
void quick_sort(int*array,int size)
void unrec_quick_sort(int*array, int size)
void insert_sort(int*array,int low,int high)
int bucket_sort(int*array,int size,int max_value)
int max_k_heap(int*array,int size,int k,int*k_array)
int max_k_select(int*array,int size,int k,int*k_array)
void find_max_min(int*array,int size,int*max,int*min)
int find_max_k(int*array,int low,int high,int k) )
- 2013-08-30 22:05:58下载
- 积分：1
|
联系客服（QQ：3324461878）
