C-language Bubble sort

#define NintMainintargcConst Char* argv[]) {intNum[n];printf("Enter 10 integers:"); for(intI=0; i<n; i++) {scanf("%d", &num[i]); } for(inti=m-1; j>=0; j--) { for(intI=0; i<j; i++) {if(num[i]<num[i+1]) {intTemp=num[i]; num[i]=num[i+1]; num[i+1]=temp; }        }    }printf("Array descending order: \ n"); for(intI=0; i<n; i++) {printf("%d", Num[i]); }printf("\ n");return 0;}

Operation Result:

Method Two:

#define NintMainintargcConst Char* argv[]) {intNum[n];printf("Enter%d integers:", N); for(intI=0; i<n; i++) {scanf("%d", &num[i]); }intTemp for(intI=0; i<n; i++) {//Inner loop         for(intj=0; j<n-1; J + +) {if(num[j]<num[j+1]) {TEMP=NUM[J]; num[j]=num[j+1]; num[j+1]=temp; }        }    }printf("Array descending order: \ n"); for(intI=0; i<n; i++) {printf("%d", Num[i]); }printf("\ n");return 0;}

Operation Result:

Method Three: (Two optimization)

#define NintMainintargcConst Char* argv[]) {intNum[n];printf("Enter%d integers:", N); for(intI=0; i<n; i++) {scanf("%d", &num[i]); }intTemp for(intI=0; i<n; i++) {//Inner loop each time the process of comparison, the loop ends to find a minimum number         for(intj=0; j<n-1-I.; J + +) {//A number is determined once per cycle            if(num[j]<num[j+1]) {TEMP=NUM[J]; num[j]=num[j+1]; num[j+1]=temp; }        }    }printf("Array descending order: \ n"); for(intI=0; i<n; i++) {printf("%d", Num[i]); }printf("\ n");return 0;}

Operation Result:

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

C-language Bubble sort