c++笔试题.docVIP

链表的反转 Link Reverse(Link Head) {Link Pointer; Link Back; Link Next; Back = Head; Pinter = Back->next; Back->next = NULL; Next = Pointer->next; Pointer->next = Back; Back = Pointer; Pointer = Next; while (Pointer->next !=NULL) {Next = Pointer->next; Pointer->next = Back; Back = Pointer; Pointer = Next; } Pointer->next = Back; Head = Pointer; return Head; } 排序方法：冒泡排序，快速排序，选择排序。 冒泡排序：if (左边的值＞右边的值)then 此两个值的位置互换。 else　此两个值的位置不变。 右边的值继续和下一个值比较。 void bubbleSort(int *list,int index) {int i, j,ttemp; while (1) {for (j=index;j>0;j--) { for(i=0;i<j-1;i++) {if(list [i]>list[i+1]) {temp=list[i+1]; list[i+1]=list[i]; list[i]=temp; } } } } } 查找：线性查找，折半查找，费氏查找，插补查找。。。。。。 折半查找：int Binary_Search(int Key) {int left; int Right; int Middle; Left = 0; Right = Max-1; while ( Left<=Right) {Middle = (Left+Right)/2; if (Key<Data[Middle]) Right=Middle-1; else if (Key>Data[Middle]) Left = Middle+1; else if (Key==Data[Middle]) {Printf("Data[%d]=%d\n",Middle,Data[Middle]);return 1;} //count++; } return 0; } 二叉树的建立与查找： 二叉树表示法：1、二叉树数组表示法2、二叉树结构数组表示法3、二叉树链表表示法 (1) //建立二叉树 void creat_btree(int *b_tree,int *nodelist,int len)//　b_tree......nodelist是数组。 {int i; int level;//树的阶层数 b_tree[1]=nodelist[1];//以第一个元素为根节点 for (i=2;i<=len;i++)//依序建立其它节点 {level = 1;//从阶层1开始建立 while (b_tree[level]!=0)//判断是否有子树存在 {if (nodelist[i] < b_tree[level])//判断是左子树还是右子树 level = level *2;//左子树 else level = level *2 + 1; //右子树 } b_tree[level] = nodelist[i];　//将元素值存入节点 } } void main() {int i,index; int data; int b_tree[16]; int nodelist[16]; printf("\nPlease input the elements of binary tree(Exit for 0):\n"); index = 1; scanf("%d", &data); while (data!=0) {nodelist[index] = data; index = index+1; scanf("%d",&data); for (i=1;i<16;i++) b_tree[i] = 0; create_btree(b_tree,nodelist,index); .............................. } } (2)struct tree{ int left; int data; int right; }; typedef struct tree treenode; treenode b_tree[15]; //建立二叉树 void creat_btree(int *b_tree,int *nodelist,int len) {int i; int level;//树的阶数 int position;//左树