Insert sort directly

1. Direct insert sort
Insert the elements to be sorted in ascending or descending order into the appropriate position .
2. principle
Take ascending order , Start with the second element of the array , from a[0] Start comparing , If you know to find the right place , That is to ensure that it is smaller than the following elements .
3. Code implementation

#include <stdio.h>

// Direct insert sort 
void display(int arr[],int size)
{
    
	for(int i=0;i<size;i++)
		printf("%d ",arr[i]);
	printf("\n");
}

void InsertSort(int arr[],int size)  // Take ascending order 
{
    
	int i,j;
  for(i=1;i<size;i++)
  {
    
	if(arr[i-1]>arr[i])
	{
    
		int temp=arr[i];
		for(j=i-1;j>=0 && arr[j]>temp;j--)
			arr[j+1]=arr[j];
		arr[j+1]=temp;
	}
  }
}
int main()
{
    
	int arr[]={
    9,18,27,6,25,44,3,12,1};
	int size=sizeof(arr)/sizeof(arr[0]);
	printf(" The array size is ：%d\n",size);
	display(arr,size);         // Before ordering 
	InsertSort(arr,size);
	display(arr,size);         // After ordering  

  return 0;
}

4. Running results