C练习

#include<stdio.h>#include<stdlib.h>#include<math.h>//void sort0(int *pointer[],int n){// int i,j,k;// int *temp;// for(i = 0; i < n-1; i++){// k = i;// for(j = i+1; j < n; j++){// if(pointer[k] > pointer[j]) // k = j;// }// if (k != i){// temp = pointer[i];// pointer[i] = pointer[k];// pointer[k] = temp;// printf("\n");// }// }//}////void sort1(int *a, int n){// int i,j,k;// int temp;// for(i = 0; i < n-1; i++){// k = i;// for(j = i+1; j < n; j++){// if(a[k] > a[j]) {// k = j;// }// }// if (k != i){// temp = *(a+i);// *(a+i) = *(a+k);// *(a+k) = temp;// printf("\n");// }// }//}////void sort2(int **pointer, int n){// int i,j,k;// int temp;// for(i = 0; i < n-1; i++){// k = i;// for(j = i+1; j < n; j++){// if(**(pointer+k) > **(pointer+j)) // k = j;// }// if (k != i){// temp = **(pointer+i);// **(pointer+i) = **(pointer+k);// **(pointer+k) = temp;// printf("\n");// }// }//}////int strcmps(char *p1, char *p2){// int i,n;// n = 0;// while(*p1 == *p2){// if(*p1 == '\0')// return 0;// *p1++;// *p2++;// }// n = *p1 - *p2;// return n;//}//t10.17/*#define LEN sizeof(struct student)struct student{int num;struct student *next;};int n;struct student *creat(void){struct student *p1,*p2,*head;n = 0;p1 = p2 = (struct student *)malloc(LEN);scanf("%d",&p1->num);head = NULL;while (p1->num != 0){n += 1;if(n == 1){head = p1;}else{p2 -> next = p1;}p2 = p1;p1 = (struct student *)malloc(LEN);scanf("%d",&p1->num);}p2->next=NULL;return head;}struct student *insert(struct student *ah,struct student *bh){ struct student *pa1,*pa2,*pb1,*pb2;pa1 = pa2 = ah;pb1 = pb2 = bh;if(ah == NULL)return bh;else if(bh == NULL)return ah;else if(ah == NULL && bh == NULL)return NULL;else{while(pa1 -> next != NULL)pa1 = pa1 -> next;pa1 -> next = pb1;return ah;}}struct student *sort(struct student *head){struct student *p,*q,*r;int temp;for(p = head; p != NULL; p = p -> next){r = p;for(q = p -> next; q != NULL; q = q -> next){ if(q -> num < r -> num)r = q;}if(r != p){temp = p -> num;p -> num = r -> num;r -> num = temp;}}return head;}void print(struct student *head){while( head != NULL){printf("%d\n",head->num);head = head -> next;}//t11.8}*//*#define N 13struct person{int num;int nextop;}link[N+1];//t11.9*/#define LEN sizeof(struct student)int n;struct list{int data;struct list *next;};typedef struct list node;typedef node *link;node *tail(void){link ptr,head,tail;int num,i;tail = (link)malloc(sizeof(node));tail -> next = NULL;ptr = tail;printf("\nplease input 5 data =>\n");for(i = 0; i<= 4; i++){scanf("%d",&num);ptr->data = num;head = (link)malloc(sizeof(node));head->next = ptr;ptr = head;}ptr = ptr->next;while(ptr != NULL){printf("The value is =>%d\n",ptr->data);ptr = ptr->next;}}struct student {int num;struct student *next;};struct student *creat(void){struct student *head,*p1,*p2;n = 0;p1 = p2 = (struct student *)malloc(LEN);head = NULL;scanf("%d",&p1 -> num);while(p1->num != 0){n += 1;if(n == 1) head = p1;else p2 -> next = p1;p2 = p1;p1 = (struct student *)malloc(LEN);scanf("%d",&p1 -> num);}p2 -> next = NULL;return head;}struct student *delet(struct student *a,struct student *b){ struct student *ahead,*pa1,*pa2,*pb;ahead = pa1 = pa2 = a;while(pa1 != NULL){pb = b;while(pb != NULL){if(pa1->num == pb->num){if(pa1 == ahead)ahead = pa1->next;elsepa2->next = pa1->next;}pb = pb->next;}pa2 = pa1;pa1 = pa1->next;}return ahead;}void print(struct student *head){while( head != NULL){printf("%d\n",head->num);head = head -> next;}}void CocktailSort(int a[], int num){ //鸡|尾2酒?排?序¨°int i,temp,bottom = 0,bound = 0,top = num - 1,swapped = 1;while(swapped==1){swapped = 0;for(i = bottom; i < top; i++){if(a[i] > a[i+1]){temp = a[i];a[i] = a[i+1];a[i+1] = temp;swapped = 1;bound = i;}}top = bound;for(i = top; i > bottom; i--){if(a[i] < a[i-1]){temp = a[i];a[i] = a[i-1];a[i-1] = temp;swapped = 1;bound = i;}}bottom =bound;}}void ChooseSort(int a[],int num){//选?择?排?序¨°int i,j,k,temp;for(i = 0; i < num-1; i++){k = i;for(j = i; j < num; j++){if(a[k] > a[j])k = j;}if(k != i){temp = a[i];a[i] = a[k];a[k] = temp;}}}void ShellSort(int a[], int num){ //希¡ê尔?排?序¨°int k = num/2,i,j,temp;while(k > 0){for(i = k; i < num; i++){temp = a[i];j = i - k;while(j >= 0 && temp < a[j]){a[j+k] = a[j];a[j] = temp;j = j-k;}}k /= 2;}}void QuickSort(int a[],int num){ //快¨¬速¨´排?序¨°int i = 0, j = num - 1;int val = a[0];if(num > 1){while(i < j){for(;j > i; j--){if(a[0] > a[j]){a[0] = a[j];break;}}for(;i < j; i++){if(a[i] > val){a[j] = a[i];break;}}}a[i] = val;QuickSort(a,i);QuickSort(a+i+1,num-1-i);}}void main(){/*int a[4] = {2,4,1,6};int i,*p[4];int **pointer;for(i = 0; i < 4; i++){p[i] = &a[i];}pointer = p;sort0(p,4);for(i = 0; i < 4; i++){printf("%4d",*(*p+i));}printf("\n");sort1(a,4);for(i = 0; i < 4; i++){printf("%4d",a[i]);}printf("\n");sort2(pointer,4);for(i = 0; i < 4; i++){printf("%4d",**(pointer+i));}printf("\n");*///char *a = {"vboy"};//char *b = {"boy"};//int n;//n = strcmps(a,b);//printf("%d",n);//t10.17/* char str[50],*strp;int a[100],*p,i,j,k,l,e10,n = 0,s = 0;gets(str);strp = &str[0];p = &a[0];i = 0; k = 0;while(*(strp+i) != '\0'){if((*(strp+i)) >= '0' && (*(strp+i)) <= '9'){ k++;}else{if(k > 0){s = *(strp+i-1) -48;j =1;for(; j < k; j++){e10 = 1;for(l = 1; l <= j; l++)e10 *= 10;s += (*(strp+i-1-j) - 48)*e10;}*p = s;n ++;p++;k = 0;}}i++;}if(k > 0){s = *(strp+i-1) -48;j = 1;for(; j < k; j++){e10 = 1;for(l = 1; l <= j; l++)e10 *= 10;s += (*(strp+i-1-j) - 48)*e10;}*p = s;n ++;p++;k = 0;}printf("%d :",n);k = 0;p = &a[0];for(k = 0; k < n; k++)printf("%d ",*(p+k));*///t10.16/*struct student *ahead,*bhead,*abh;ahead = creat();bhead = creat();abh = insert(ahead,bhead);abh = sort(abh);printf("\n");print(abh);t11.8 *//* int i,count,h;for(i = 1; i <= N; i++){if(i == N)link[i].nextop=1;elselink[i].nextop = i+1;link[i].num =i;}printf("\n");count = 0;h=N;printf("%ds\n",h);while(count <N-1){i = 0;while(i != 3){h = link[h].nextop;if(link[h].num)i++;}printf("%4d",link[h].num);link[h].num = 0;count++;}printf("\n the last one is");for(i=1;i<=N;i++){if(link[i].num)printf("%3d",link[i].num);}//t11.9*/int i,n;for(i = 1; i < 5; i++){n = 0;if(i != 1)n = n+1;if(i == 3)n = n+1;if(i == 4)n = n+1;if(i != 4)n = n+1;if(n == 3)printf("%c",64+i);}}。