常用查找算法汇总
摘要:1.折半查找 1 //折半查找的非递归实现 2 int BinSrch(SeqRList L, int K)//L为一个顺序查找表 3 { 4 int low = 1, high = L.length, mid; 5 while (low <= high) 6 { 7 mid = (low + hi
阅读全文
posted @ 2017-03-29 21:32
posted @ 2017-03-29 21:32
posted @ 2017-03-26 16:42
posted @ 2017-03-20 17:45
posted @ 2017-03-19 22:17
posted @ 2017-03-12 19:34
posted @ 2017-03-12 14:19