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