Guest User

Untitled

a guest
Nov 8th, 2017
111
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Java 0.93 KB | None | 0 0
  1. class InsertionSort {
  2.  
  3.     static void insertionSort(int a[]) {
  4.         for (int i = 1; i < a.length; i++) {
  5.             int index = i;
  6.             while (index > 0 && a[i] < a[index - 1]) {
  7.                 int temp = a[index];
  8.                 a[index] = a[index - 1];
  9.                 a[index - 1] = temp;
  10.                 index--;
  11.             }
  12.         }
  13.     }
  14.  
  15.     static void insertionSort2(int a[]) {
  16.         for (int i = 1; i < a.length; i++) {
  17.             int current = a[i];
  18.             int index = i;
  19.             while (index > 0 && current < a[index - 1]) { // musi być tutaj current zamiast a[i]. Dlaczego?
  20.                 int temp = a[index];
  21.                 a[index] = a[index - 1];
  22.                 a[index - 1] = temp;
  23.                 index--;
  24.             }
  25.         }
  26.     }
  27.  
  28.     public static void main(String[] args) {
  29.  
  30.         int[] a = {9991,2,7,6,3,2,-231,4542,24,0,21};
  31.         insertionSort(a);
  32.         System.out.println(Arrays.toString(a)); // [2, 7, 6, 3, 2, -231, 4542, 24, 0, 21, 9991]
  33.  
  34.         insertionSort2(a);
  35.         System.out.println(Arrays.toString(a)); // [-231, 0, 2, 2, 3, 6, 7, 21, 24, 4542, 9991]
  36.  
  37.     }
  38. }
Advertisement
Add Comment
Please, Sign In to add comment