2. Various sorting algorithms and program sorting algorithms in the program

2. Various sorting algorithms and program sorting algorithms in the program

1. Bubble Sorting

The Bubble Sorting Algorithm operates as follows:

(1) Compare adjacent numbers in ascending order or ascending order,

(2) after such a trip, the largest or smallest number is exchanged to the last digit,

(3) then compare and exchange data from the beginning until the last and second digits.

The average time complexity of Bubble Sorting is

1 void bubble_sort (int a [], int n) 2 {3 int I, j, temp; 4 for (j = 0; j <n-1; j ++) 5 {6 for (I = 0; I <n-1-j; I ++) 7 {8 if (a [I]> a [I + 1]) 9 {10 temp = a [I]; 11 a [I] = a [I + 1]; 12 a [I + 1] = temp; 13} 14} 15} 16}

View Code

2. Quick sorting

 

3. Insert sorting

 

4. Hill sorting

 

5. Select sorting

 

6. Merge and sort