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]; |
| 11 | + | |
| 12 | ||
| 13 | for (int i = 1; i < tomb.Length; i++) | |
| 14 | {
| |
| 15 | index = tomb[i]; | |
| 16 | int j; | |
| 17 | j = i; | |
| 18 | ||
| 19 | while ((j > 0) && (tomb[j - 1] > index)) | |
| 20 | {
| |
| 21 | if (tomb[i] > tomb[j]){
| |
| 22 | csere--; | |
| 23 | }else {
| |
| 24 | csere++; | |
| 25 | } | |
| 26 | tomb[j] = tomb[j - 1]; | |
| 27 | j = j - 1; | |
| 28 | } | |
| 29 | tomb[j] = index; | |
| 30 | } | |
| 31 | ||
| 32 | Console.WriteLine(); | |
| 33 | ||
| 34 | for (int i = 0; i < tomb.Length; i++) {
| |
| 35 | Console.Write(tomb[i] + " "); | |
| 36 | } | |
| 37 | - | Console.WriteLine(csere+"\n"); |
| 37 | + | Console.WriteLine(csere+"\n"); |