随机生成20个整数,快速排序,折半查找搜索给定元素.docVIP

#include stdio.h #include stdlib.h #include time.h int Partition(int a[],int low,int high) {//swap a[low] and a[high],return the pivots position int temp=0,pivotkey=a[low]; while(lowhigh){ while(lowhigha[high]=pivotkey)--high; temp=a[high]; a[high]=a[low]; a[low]=temp; while(lowhigha[low]=pivotkey)++low; temp=a[high]; a[high]=a[low]; a[low]=temp; } return low; } int QSort(int a[],int low,int high) {//quicksort a[low...high] int pivotloc; if(lowhigh){ pivotloc=Partition(a,low,high); QSort(a,low,pivotloc-1); QSort(a,pivotloc+1,high); } else return 0; } int Search_Bin(int a[],int low,int high,int z) {//Binary Search the number equal to the number you are searching for,if its founded,return the position .Otherwise,return -1 int mid; mid=(low+high)/2; while(low=high){ if(z==a[mid])return mid; if(z==a[low])return low; if(a[mid]z)return Search_Bin(a,low,mid-1,z); else return Search_Bin(a,mid+1,high,z); } return -1; } int main() { int i,t,s,res,low,high;int b[20]; int randomize(); printf(Twenty random numbers:\n\n); for(i=0;i20;i++){ b[i]=rand(); printf(%d\n,b[i]); } printf(Please input 0 to sort:\n\n); scanf(%d,t); if(t==0){ printf(Sorted numbers are:\n\n); if(QSort(b,0,19)==0){ for(i=0;i20;i++) printf(%d\n,b[i]); printf(Please input the number you want to search for:\n\n); scanf(%d,s); res=Search_Bin(b,0,19,s); if(res!=-1) printf(index=%d\n,res+1);//if the number is found,output the numbers position in the sorted array else printf(Not found\n);//if the number isnt found,output Not found } } return 0; }