快速排序
[68,11,69,23,18] ,70,[93,73] 4. （8分）
0 1 2 3 4 5 6 7 8 9 10
11 22 47 92 16 3 7 29 8 ASL=5/3 5. （6分）
A
B D C E F
G I H
五、 算法设计题（8分） typedef struct { int key; float info; }JD;
int binsrch(JD r[],int n,int k) { int low,high,mid,found; low=1; high=n; found=0;
while((low<=high)&&(found==0)) { mid=(low+high)/2;
if(k>r[mid].key) low=mid+1; else if(k==r[mid].key) found=1; else high=mid-1; }
if(found==1) return(mid); else return(0); }
41
42
43
44
45
46