Insert sort of sort

One Algorithmic thought

 

Take ascending order as an example ：

The first data is regarded as the sorted data , From the subscript for 1 The second data of starts sorting , Take this data as end. Need to put end+1 Insert the data of into the previous data , To form orderly data . Then open up a tmp Space , Store this data first , To prevent the subsequent data from moving backward as a whole and disappearing when inserting .

Will be tmp The data stored in the space is compared with the previous data one by one , If tmp Smaller than the previous data , Then we need to move the data of this position back one position ,tmp Then compare with the previous data . until tmp> Data for this location , Then insert the data into the next location of the location .（ A data location has been reserved by moving ）.

The above operation is a data insertion operation , All data needs to be operated , So set another layer of cycle control outside .

Two Code display

#define _CRT_SECURE_NO_WARNINGS 1 
#include<stdio.h>
#include<assert.h>
#include<stdlib.h>

void insertsort(int* pa, int size)
{
	assert(pa);

	int i = 0;
	for (i = 1; i <size-1; i++) 
	{
		int end = i;
		int tmp = pa[end + 1];
		while (end >= 0)
		{
			if (tmp < pa[end])
			{
				pa[end + 1] = pa[end];
				end--;
			}

			else
			{
				break;
			}

		}

		pa[end+1] = tmp;
	}
}

int main()
{
	int a[] = { 11,25,6,87,98,69,30,23,10,2 };
	int size = sizeof(a) / sizeof(a[0]);
	insertsort(a, size);
	int i = 0;
	for (i = 0; i < size; i++)
	{
		printf("%d ", a[i]);
	}
	return 0;
}