View difference between Paste ID: KSmdKDrx and Dv7gdbQH
SHOW: | | - or go back to the newest paste.
1
//int[] tomb = new int[10] { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10};    // 0 csere
2
//int[] tomb = new int[10] { 1, 2, 3, 4, 5, 6, 7, 9, 8, 10 };   // 1 csere
3
//int[] tomb = new int[10] { 1, 7, 10, 3, 2, 8, 4, 9, 6, 5 };   // 5 csere
4
int[] tomb = new int[10] { 7, 10, 1, 3, 2, 8, 4, 9, 6, 5 };     // 7 csere
5
6
for (int i = 0; i < tomb.Length; i++) {
7
    Console.Write(tomb[i]+" ");
8
}
9
                                  
10
int index;
11
int[] rendezett=new int[10];
12
int csere =0;
13
14
for (int i = 1; i < tomb.Length; i++)
15
{
16
    index = tomb[i];
17
    int j;
18
    j = i;
19
                
20
    while ((j > 0) && (tomb[j - 1] > index))
21-
        if (tomb[i] > tomb[j])
21+
22-
        {
22+
        if (tomb[i] > tomb[j]){
23-
            csere--;
23+
		csere--;
24-
        }
24+
        }else { 
25-
        else { csere++; }
25+
		csere++; 
26
	}
27
        tomb[j] = tomb[j - 1];
28
        j = j - 1;
29
    }
30
    tomb[j] = index;
31
}
32
33
Console.WriteLine();
34
for (int i = 0; i < tomb.Length; i++) {
35
    Console.Write(tomb[i] + " ");
36
}
37
Console.WriteLine(csere+"\n");
38
Console.WriteLine();