//int[] tomb = new int[10] { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10};    // 0 csere
//int[] tomb = new int[10] { 1, 2, 3, 4, 5, 6, 7, 9, 8, 10 };   // 1 csere
//int[] tomb = new int[10] { 1, 7, 10, 3, 2, 8, 4, 9, 6, 5 };   // 5 csere
int[] tomb = new int[10] { 7, 10, 1, 3, 2, 8, 4, 9, 6, 5 };     // 7 csere

for (int i = 0; i < tomb.Length; i++) {
    Console.Write(tomb[i]+" ");
}

int index;
int[] rendezett=new int[10];
int csere =0;
for (int i = 1; i < tomb.Length; i++)
{
    index = tomb[i];
    int j;
    j = i;

    while ((j > 0) && (tomb[j - 1] > index))
    {
        if (tomb[i] > tomb[j])
        {
            csere--;
        }
        else { csere++; }
        tomb[j] = tomb[j - 1];
        j = j - 1;
    }

    tomb[j] = index;
}

Console.WriteLine();
for (int i = 0; i < tomb.Length; i++) {
    Console.Write(tomb[i] + " ");
}
Console.WriteLine(csere+"\n");
Console.WriteLine();