Java: Insertion Sort 1

InsertSort1.java

package introalgo.chap2;

import java.util.Random;

public class InsertSort1 {
  
  public static void main( String[] args ) {
    
    Random random = new Random();
    
    int[] data = new int[10];
    for (int i = 0; i < data.length; i++) {
      data[i] = 100 + random.nextInt(900);
      System.out.printf("%d ", data[i]);
    }
    System.out.println();
    
    for (int i = 1; i < data.length; i++) {
      int tmp = data[i];
      int j = i - 1;
      for (; (j > -1) && (data[j] > tmp); j--) {
        data[j + 1] = data[j];
      }
      data[j + 1] = tmp;
    }
    
    for (int i = 0; i < data.length; i++) {
      System.out.printf("%d ", data[i]);
    }
    System.out.println();
    
  }
  
}