摘要:
# include# includevoid quick_sort(int num[],int left,int right){ int i,j,t; int x=num[left];//基准数 i=left; j=right; if (left>right... 阅读全文
摘要:
//今天打算实现归并算法 时间复杂度o(nlog(n))# include# define MAXSIZE 10void merging(int *list1,int list1_size,int *list2,int list2_size)//将两个已经排好... 阅读全文