1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237
| #include<iostream> using namespace std; #define OK 1 #define OVERFLOW -1 #define ERROR 0 #define MAXSIZE 100 typedef int KeyType; typedef struct{ KeyType key; }ElemType; typedef struct{ ElemType *R; int length; }SSTable; void initSSTable(SSTable &ST){ ST.R=(ElemType *)malloc(sizeof(ElemType)*MAXSIZE); ST.length=0; for(int i=1;i<=100;i++){ ST.R[i].key=i; ST.length++; } } int Search_Bin(SSTable ST,KeyType key,int &cnt,int &idx){ int low=1,high=ST.length; while(low<=high){ cnt++; int mid=(low+high)/2; if(ST.R[mid].key==key){ idx=mid; return OK; } if(ST.R[mid].key<key) low=mid+1; else high=mid-1; } return ERROR; }
typedef struct{ KeyType key; }treeElemType; typedef struct BSTNode{ treeElemType data; BSTNode *lchild,*rchild; }BSTNode,*BSTree; int InsertBST(BSTree &T,int num){ if(T){ if(T->data.key>=num) InsertBST(T->lchild,num); else InsertBST(T->rchild,num); }else{ BSTNode* S=new BSTNode; S->data.key=num; S->lchild=S->rchild=NULL; T=S; } return OK; } BSTree SearchBST(BSTree T,KeyType key,int &cnt){ cnt++; if(!T||T->data.key==key) { return T; } else{ if(T->data.key<key) return SearchBST(T->rchild,key,cnt); else return SearchBST(T->lchild,key,cnt); } } void InOrderTraverse(BSTree T){ if(T){ InOrderTraverse(T->lchild); cout<<T->data.key<<" "; InOrderTraverse(T->rchild); } }
typedef struct{ int *elem; int length; }SqList; int InitList(SqList &L){ L.elem=new int[MAXSIZE]; if(!L.elem) exit(OVERFLOW); L.length=0; cout<<"输入待排序数据个数:"; int n,num; cin>>n; cout<<"输入每一个数:"; for(int i=0;i<n;i++){ cin>>num; L.elem[i+1]=num; L.length++; } return OK; } void TraverseList(SqList L){ cout<<"线性表数据为:"; for(int i=1;i<=L.length;i++){ cout<<L.elem[i]<<" "; } cout<<endl; } int Partition(SqList &L,int low,int high){ L.elem[0]=L.elem[low]; while(low<high){ while(low<high&&L.elem[high]>=L.elem[0]) --high; L.elem[low]=L.elem[high]; while(low<high&&L.elem[low]<=L.elem[0]) ++low; L.elem[high]=L.elem[low]; } L.elem[low]=L.elem[0]; return low; } void QSort(SqList &L,int low,int high){ if(low<high){ int pivotloc=Partition(L,low,high); QSort(L,low,pivotloc-1); QSort(L,pivotloc+1,high); } } void QuickSort(SqList &L){ QSort(L,1,L.length); }
void Merge(int R[],int T[],int low,int mid,int high){ int i=low,j=mid+1,k=low; while(i<=mid&&j<=high){ if(R[i]<=R[j]) T[k++]=R[i++]; else T[k++]=R[j++]; } while(i<=mid) T[k++]=R[i++]; while(j<=high) T[k++]=R[j++]; } void MSort(int R[],int T[],int low,int high){ int *S=new int[MAXSIZE]; if(low==high) T[low]=R[low]; else{ int mid=(low+high)/2; MSort(R,S,low,mid); MSort(R,S,mid+1,high); Merge(S,T,low,mid,high); } delete []S; } void MergeSort(SqList &L){ MSort(L.elem,L.elem,1,L.length); } int main(){
while(true){ SSTable ST; BSTree T; SqList L; int key,cnt=0,idx=0,order=0,n,num; cout<<"** pyai ********************\n"; cout<<"** 1.初始化顺序表,自动添加[1:100]一百个数据 **\n"; cout<<"** 2.显示数据表内容 **\n"; cout<<"** 3.输入你要查找的数并返回在线性表中的查找结果 **\n"; cout<<"** 4.初始化二叉排序树,并添加数据 **\n"; cout<<"** 5.显示二叉排序树的数据 **\n"; cout<<"** 6.输入你要查找的数并返回在二叉排序树中结点的指针 **\n"; cout<<"** 7.输入待排序数的个数和分别都是几 **\n"; cout<<"** 8.输出你输入的线性表 **\n"; cout<<"** 9,快速排序刚才的线性表 **\n"; cout<<"** 10,归并排序刚才的线性表 **\n"; cout<<"** -1,退出 **\n";
cout<<"****\n"; cout<<"输入命令:"; cin>>order; if(order==-1) break; switch(order){ case 1: initSSTable(ST); break; case 2: for(int i=1;i<=ST.length;i++){ cout<<ST.R[i].key<<" "; } cout<<endl; break; case 3: cout<<"请输入你要查找哪个数:"; cin>>key; if(Search_Bin(ST,key,cnt,idx)){ cout<<"查找成功,查找次数:"<<cnt<<",下标:"<<idx<<"\n"; }else cout<<"查找失败\n"; break; case 4: cout<<"你要在二叉排序树插入几个数:"; cin>>n; cout<<"输入你要插入的所有数据"; for(int i=0;i<n;i++){ cin>>num; InsertBST(T,num); } break; case 5: InOrderTraverse(T); cout<<endl; break; case 6: cout<<"请输入你要查找哪个数:"; cin>>key; if(SearchBST(T,key,cnt)!=NULL){ cout<<"查找成功,查找次数:"<<cnt<<",指针为:"<<T<<"\n"; }else cout<<"查找失败\n"; break; case 7: InitList(L); break; case 8: TraverseList(L); break; case 9: QuickSort(L); break; case 10: MergeSort(L); break; } } return 0; }
|