Sorting method in c language

Selection and bubbling are the most common sorting methods in C language.

1 bubble method is used to sort the numbers of 10.

# include & ltstdio.h & gt

void main()

{ int a[ 10]；

int i，j，t；

Printf ("Please enter the number 10: \ n");

for(I = 0； I< 10; i++)

scanf("%d "，& ampa[I])；

printf(" \ n ")；

for(j = 0； j & lt9; J++) // 9 cycles to achieve 9 comparisons.

for(I = 0； I<9-j; J++) // Make 9-j comparisons in each comparison.

if(a[I]& gt； A[i+ 1]) // Sinking interchange of two adjacent numbers.

{ t = a[I+ 1]；

a[I+ 1]= a[I]；

a[I]= t；

}

Printf ("Sorted Numbers: \ n");

for(I = 0； I< 10; i++)

printf("%d "，a[I])；

printf(" \ n ")；

}

No matter how many numbers there are, you can realize the function by changing them. Defining a large array can be achieved through multiple loops.

2 Select the method to sort the number 10.

This method is not as convenient as the bubbling method, so it will not be described.