数据结构(含课程设计)作业 华工.docxVIP

数据结构（含课程设计）·数据结构课程作业??提交方式：附件一、程序阅读填空1. 在顺序表中第i个位置插入新元素 xtemplate class Type intSeqListType::Insert (Type x, inti){ if (i0||ilast+1||last==MaxSize-1) return 0; //插入不成功 else {last++;for( ______int j = MaxSize-1______;ji;j--)_______data[j+1] = data[j]______;data[i] = x;return 1; //插入成功}}??直接选择排序的算法 template class Type void SelectSort(datalistType list) { for(inti=0; ilist.CurrentSize-1; i++) ____SelectExchange(list,i)_____; }?template class Type viodSelectExchange(datalistType list, constinti){int k = i; for(int j=i+1;j list.CurrentSize;j++)if(list.Vector[j].getKey()list.Vector[k].getKey())?___k = j________;//当前具有最小关键码的对象 if(k!=i) Swap(list.Vector[i], list.Vector[k]); //交换}??3、删去链表中除表头结点外的所有其他结点template class Type void ListType :: MakeEmpty ( ) {ListNodeType *q; while (first→link!=NULL){? ______q = first -link___________; ?______first-link = q - link_________; //将表头结点后第一个结点从链中摘下 delete q; //释放它 } last = first; //修改表尾指针}?4、基于有序顺序表的折半有哪些信誉好的足球投注网站递归算法（Element为有序顺序表）template class Type intorderedListType ::BinarySearch(const Type x, constint low, constint high)const{int mid = -1; if ( low = high ) {? ____mid = (low + high)/2_________; if ( Element[mid].getKey( ) x )? mid = BinarySearch (_____x, mid+1, high______); else if ( Element[mid].getKey( ) x ) mid = BinarySearch ( x, low, mid -1 ); } return mid;}??5、在顺序表中第i个位置插入新元素 x 。int insert(sqlist *L, datatype x, inti){ int j; if (L-n==maxsize) {cout”表满，不能插入！（上溢）\n”; return –1; }if( i 0 || i = maxsize ) {cout”非法插入位置！\n”; return 0;}for(j=L-n;j=i;j--)L-data[j]=L-data[j-1]; //节点后移L - data[j] = x; //插入xL-n++; //修改表长Return 1; //插入成功}??6、直接选择排序的算法void SelectSort( list R, int n ){ inti, j, k; for (i=1; i=n-1;i++) { //n-1趟排序k=1 ; for(j=i+1;j=n,j++) //在当前无序区中找键值最小的记录R[k] if(R[j].keyR[k].key) k=j ;i