Common sorting methods

Exchange class sorting

1、 Bubble sort

The idea is to compare two adjacent elements

When using bubble sort , Only one best value can be selected at a time , Yes n The maximum number of elements to execute （n - 1） Compare it to

#include "stdio.h"
 
void main()
{
     
      int a[10]; 
      int i, j, temp; 

      printf("Please input ten numbers: \n"); 
      for (i = 0; i < 10; i++) 
            scanf("%d", &a[i]); 
 

      for (i = 0; i < 9; i++) // 10 Number ,10 - 1 Wheel bubbling , Each round pushes the current maximum number to the end  
      {
     
            for (j = 0; j < 9 - i; j++) // 9 - i, It means that after a round of bubbling , Just reduce one comparison  
            
				if (a[j] > a[j+1]) 
				{
     
					  temp = a[j]; 
					  a[j] = a[j+1]; 
					  a[j+1] = temp; 
				} 
      } 
  
      for (i = 0; i < 10; i++) 
            printf("%d\n", a[i]); 
}

2、 Quick sort

Is the process of finding the correct index position for benchmark data .

Select a benchmark value during each sorting , Then compare all elements with the benchmark value , And divided into two piles according to the size , Then execute the process recursively , Until all elements are sorted .

1> Take a number from the sequence as the reference number first .
2> Partition process , Put all the larger numbers to the right of it , Less than or equal to its number all put it to the left .
3> Repeat the second step for the left and right sections , Until there is only one number in each interval .

Insert class sort

1、 Simple insertion sort

2、 Hill sort

Select the sort of class

1、 Simple selection sequencing

2、 Push sort method