摘要:
二分法查找是在有序线性表查找指定的元素 int BinarySort(int n) { int low,high,mid; low = 0; high = length -1; while (low <= high) { mid = (low+high) / 2; if (n == m_num[mid]) return...
阅读全文
posted @ 2009-03-16 17:03
Ruby_Wang
阅读(379)
推荐(0)
编辑
摘要:
归并排序的思想很像是插入排序,只不过插入的元素是已经排序好了的数组。 void CMergeSort::Merge(double R[], double R1[], int low, int mid, int high) { int i=low,j=mid+1,k=low; while ((i<=mid) && (j<=high)) { if (R[i] <= ...
阅读全文
posted @ 2009-03-16 16:20
Ruby_Wang
阅读(218)
推荐(0)
编辑