ex13-06.cpp

数据结构常用算法合集

//Ex13-06.cpp
#include <fstream.h>		//cout,cin,ofstream
#include <conio.h>		//getch()
#include <stdlib.h>		//random
const int N=100;
int search(int[],int);
void main()
{ ofstream outfile("lsort.txt");
  int a[N],i,j,data,pos;
  char yn;
  randomize();
  for (i=0;i<N;i++)
  a[i]=random(100);
  for (i=0;i<N-1;i++)
  for (j=0;j<N-i-1;j++)
  if (a[j]>a[j+1])
  { int t=a[j];
    a[j]=a[j+1];
    a[j+1]=t;
  }
  for (i=0;i<N;i++)
  outfile << a[i]<<' ';
  do
  { cout << "Enter data to search:";
    cin >> data;
    pos= search(a,data);
    if (pos!=-1)
    cout << "Position="<<pos<<endl;
    else
    cout << "Not Find.\n";
    cout << "Search again?(y/n)";
    cin >> yn;
  }while (yn!='n');
}
int search(int data[],int key)
{ int L=0,M,R=N;
  while (R>=L)
  { M = (L+R)/2;
    if (key==data[M])
    return M;
    else
    if (key>data[M])
      L = M +1;
    else R = M - 1;
  }
  return -1;
}