朱胜本的专栏

/*分治思想的各种算法*/ #include #include /*二分检索算法*/ int BinarySearch(int a[],int n,int e) { int index; int low=0,high=n-1, mid; while(low <= high) { mid = (low + high) / 2;

#include #include /* 冒泡排序 */ int BubbleSort(int a[],int n) { int i,j,temp,exchanged=0,cycles=0; for(i=0; i<n; i++) { exchanged = 0; for(j=n-1; j>i; j--) {

#include #include /* 堆排序 */ void HeapAdjust(int a[],int index,int n) { //注意规定a[0]不存放元素,当做缓存用 int i,father = index,son; a[0] = a[index]; for(son=2*father; son<=n; son*=2)//比较子节点 {