对有序表的查找（快步搜索算法）

 

/*
伪代码:
Input: 表L, 表的长度n, 步长s, 元素x
Output: x所在的位置
Algorithm QS(L, M, N, S, X)  //在长度为N的有序表中以S为步长，查找X所在的位置
begin
 m:=s + m;
 while m<n do
  case
   x = L(m); return m;
   x < L(m); QS(L, m-k, m-1, s/2, x);
   otherwise m:= m+s;
  end of case
 end of while

 if m-s < n
  then QS(L, m-s, n, s/2, x);
end
*/

//程序实现：

#include <stdio.h>

#define N 20
#define S 6
#define X 41

int QS(int a[], int m, int n, int s, int x)
{
 int k =0, j = 0;

 m = m + s;
 while (m < n)
 {
  if (s == 0)
   return -1;

  if (x == a[m])
  {
   return m;
  }
  else if (x < a[m])
  {
   k = m - s;
   s = s / 2;
   j = QS(a, k, m-1, s, x);
  }
  else
  {
   m = m + s;
  }
 }

 if ( m == n)
 {
  if (x == a[m])
   return m;
  else
   return -1;
 }

 while ((m > n) && ((m - s) < n))
 {
  k = m - s;
  s = s / 2;
  j = QS(a, k, n, s, x);
 }

 return j;
}

int main(void)
{
 int a[N] = {4, 9, 12, 14, 27, 30, 32, 36, 41, 48, 55, 57, 60, 68, 73, 75, 85, 88, 96, 98};
 int j = 0;

 j = QS(a, 0, N-1, S, X);
 
 if (j < 0)
  printf("%d is not exist\n", X);
 else
  printf("%d is the number %d\n", X, j + 1);

 return 0;
}