//сортировка вставками с бинарным включением
void BinaryInclusionSorting(ref int[] array)
{
	int temp, left, right, middle;
	for (int i = 1; i < array.Length; ++i)
		if (array[i - 1] > array[i])
		{
			temp = array[i];
			left = 0;
			right = i - 1;
			do
			{
				middle = (left + right) / 2;
				if (array[middle] < temp)
					left = middle + 1;
				else
					right = middle - 1;
			} while (left <= right);
			for (int j = i - 1; j >= left; --j)
				array[j + 1] = array[j];
			array[left] = temp;
		}
}