摘要:
代码如下:#include #include #include #define N 50000void merge(int [],int,int,int);//归并排序数组合并函数声明void mergesort(int [],int,int);//归并排序数组排序函数声明//主函数int main(){ int i,a1[N]; double t1,t2,t3,t4; for(i=0;imiddle) for(k=j;k<=high;k++) { b[i]=a[k]; i++; } else { ... 阅读全文
posted @ 2013-12-05 15:46
清凉一夏o0
阅读(210)
评论(0)
推荐(0)
摘要:
代码如下:#include using namespace std; void BubbleSort(int *list,int len){ int i,j,temp; for(i=0;ilist[j+1]) { temp=list[j]; list[j]=list[j+1]; list[j+1]=temp; } }} int main (){ int list[10]; int n=10,m=0; cout>list... 阅读全文
posted @ 2013-12-05 15:42
清凉一夏o0
阅读(180)
评论(0)
推荐(0)
摘要:
代码如下:#include int binary_search(int array[], int value, int size) { int found = 0; int high = size, low = 0, mid; mid = (high + low) / 2; printf("\n\nLooking for %d\n", value); while ((! found) && (high >= low)) { printf("Low %d Mid %d High %d\n", low, mid, high); if ( 阅读全文
posted @ 2013-12-05 15:40
清凉一夏o0
阅读(198)
评论(0)
推荐(0)

浙公网安备 33010602011771号