Select sort and insert sort

1. Selection sort

1） Sort by selection from large to small , From 0 The number begins ;
2） Find the angle sign of the maximum value max, The value in the corresponding array a[max];
3） Take what you get a[max] And a[0] In exchange for ;
4） From 1 The number begins , repeat 2）3）;
5） end .

void selectMax(int a[], int n)
{
    
	int max;
	int temp;
	for (int j = 0; j < n - 1; j++)
	{
    
	
		max = j;
		for (int i = j + 1; i < n; i++)
		{
    
			if (a[max] < a[i])
			{
    
				max = i;// Traverse , Get the subscript of the maximum value in the array 
			}
		}
		
		if (max != j)  // Put the maximum value first 
		{
    
			temp = a[max];
			a[max] = a[j];
			a[j] = temp;
		}
	}
}

2. Insertion sort

void InsertSort(int a[], int len) 
{
    
	int temp, i, j;
	for (i = 1; i < len; i++)
	{
    
		if (a[i] < a[i - 1]) 
		{
    
			temp = a[i];          // Save it with a temporary variable 
			for (j = i - 1; a[j] > temp&& j >= 0; j--)
			{
    
				a[j + 1] = a[j];                   // Compare everything i The big one will move back , Because big numbers are always behind 
			}
			a[j + 1] = temp;   // What needs to be noted here is j+1, transfer bug So tired  ->@@
		}
	}
}