折半查找和快速排序

實驗項目名稱折半查找和快速排序查找實驗目的及要求目的：是同學們理解并掌握折半查找和快速排序查找法要求：根據所學的內容進行實驗實驗內容折半查找和快速排序查找實驗步驟折半查找#include<stdio.h>#include<malloc.h>typedefintKeyType;typedefstruct{ KeyTypekey;}ElemType;typedefstruct{ ElemType*elem; intlength;}SSTable;intSearch_Sq(SSTableST,KeyTypekey){ ST.elem[0].key=key; for(inti=ST.length;ST.elem[i].key!=key;--i); returni;}intBinSearch(SSTableST,KeyTypekey){ intlow,high,mid; low=1; high=ST.length; while(low<=high){ mid=(low+high)/2; if(ST.elem[mid].key==key)returnmid; else if(ST.elem[mid].key>key)high=mid-1; else low=mid+1; }return0;}voidmain(){KeyTypea[]={0,13,24,35,32,65,19,7,74,20,38}; SSTableT; T.elem=(ElemType*)malloc(11*sizeof(ElemType)); T.length=10;for(inti=1;i<=10;i++) T.elem[i].key=a[i]; printf("要找的元素的位置為%d\n",Search_Sq(T,35)); SSTableS; S.elem=(ElemType*)malloc(11*sizeof(ElemType)); S.length=10; KeyTypeb[]={0,2,4,6,8,10,12,14,16,18,20}; for(intk=1;k<=10;k++) S.elem[k].key=b[k]; printf("要進行折半查找的元素的位置為%d\n",BinSearch(S,10));}2、#include<stdio.h>inta[]={11,54,7,62,85,1,39,78,9,5,21,13,98,18,80,16};intPartition(inti,intj){ intlow=a[i]; while(i<j) { while((i<j)&&(a[j]>low)) { j--; } a[i]=a[j]; while((i<j)&&(a[i]<low)) { i++; } a[j]=a[i]; } a[i]=low; returni;}voidQuickSort(intleft,intright){ if(left<right) { intpivotpos=Partition(left,right); QuickSort(left,pivotpos-1); QuickSort(pivotpos+1,right);}}intmain(){ printf("排序前："); for(inti=0;i<sizeof(a)/sizeof(a[0]);i++) { printf("%d",a[i]); } printf("\n"); QuickSort(0,sizeof(a)/sizeof(a[0])-1); printf("排序后:"); for(i=0;i<sizeof(a)/sizeof(a[0]);i++) { printf("%d",a[i]); } printf("\n"); return0;}實驗環(huán)境MicrosoftVisualC++實驗結果