C/C++直接插入排序

# include <iostream>

void insertSort(int array[], int n);

void outArray(int array[], int n);

int main()
{
    const int n = 10;
    int array[n] = { 6,5,4,3,2,1,0,7,8,9 };

	insertSort(array, n);

    return 0;
}


// 直接插入排序 2020年1月9日17:56:32
void insertSort(int array[], int n)
{
	int i, j, temp, count = 0;

	for (i = 1; i < n; i++)
	{
		temp = array[i];
		j = i - 1;

		while (temp < array[j])
		{
			count++;

			array[j + 1] = array[j];
			j--;
		}

		array[j + 1] = temp;

		outArray(array, n);
	}
	std::cout << "直接插入排序 count = " << count << "\n\n";
}

void outArray(int array[], int n)
{
	int k;

	for (k = 0; k < n; k++)
	{
		std::cout << array[k] << "  ";
	}
	std::cout << "\n";
}