数据结构的二分查找法实现

这是《数据结构与算法分析C语言描述》的22页相关内容编程。

#include
using namespace std;
#define N 500
#define theNumber 83
#define NotFound -1
// generate random integer number
int * generateNumbers(int num)
{
  int * data = (int *) malloc(sizeof(int)*num);
  // cout<< "generated number is : ";
  for(int i = 0; i < num; i++)
  {
    data[i] = random() % 100;
    // cout<< data[i] << " ";
  }
  // cout< data[j + 1])
      {
        tempData = data[j];
        data[j] = data[j + 1];
        data[j + 1] = tempData;
      }
    }
  // cout<<"sorted number is : ";
  // for(int i = 0; i < num; i++)
  // {
  //   cout< right)
  {
    cout<< "system collapse!!"< number)
  {
    index = binarySearch(data, number, left, center - 1);
    if(index == -1)
    {
      cout<<"the number not exits in the sequence"<< endl;
    }
  }
  return index;  
}

// binary search algorithm in book
int binarySearchInBook(const int A[], int x, int n)
{
  int low, mid, high;
  low = 0;
  high = n - 1;

  while (low <= high)
  {
    mid = (low + high) / 2;
    if(A[mid] > x)
    {
      high = mid - 1;
    }
    else if (A[mid] < x)
    {
      low = mid + 1;
    }
    else if (A[mid] == x)
    {
      return mid;
    }
  }
  return NotFound;
}

int main()
{
  // generate data
  cout<<"generate data"<