橘子皮

摘要： 查找顺序查找Int seqsch (ElemTYpe a[], int n, KeyType k){for (int I = 0; I < n; l++){if (a[l].key == k)Break;}If ( I < n)return I;elsereturn -1;}顺序查找的改进法，改进后的算法省略了对下标越界的检查，所以提高了速度：Int seqsch (ElemTYpe a[], int n, KeyType k){A[n].key = k;// 设置岗哨for (int I = 0;; l++){if (a[l].key == k)Break;}If ( I < 阅读全文