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
超市管理系统
#include /*输入，输出头文件*/
#include /*申请空间头文件*/
#include /*对字符串加工头文件*/
#include
#include
/*清屏头文件*/
struct arraysGoods
{
int goods_id; //商品编号
char goods_name[50]; //商品名称
char goods_address[50]; //商品产地
char goods_type[50]; //商品种类
float goods_inputprice; //商品进价
float goods_outputprice; //商品售价
int goods_num; //商品进货量
};
struct arraysGoods GoodsDates[50]={ {2013,"衬衫","北京","c",1.4,2.5,5},{2012,"裤子","上海","b",1.3,2.5,6}, {2011,"短袖","大连","a",1.1,2.5,7}};
struct arraysGoods GoodsDates2[50];
void loginTitle();
void loginManager();
void selectManagerMenu();
void spendPassager();
v
- 2022-01-24 09:53:17下载
- 积分：1
