package l19;

/**
 * Test selection and two variants of insertion sort
 *
 * @author Lech Szymanski
 *
 */

import java.util.Random;
import l16.*;

public class Test {

   public static void main(String[] args) {

      IntSorter s;
      int visualiser_delay = 10;  // Delay between graphic updates in ms -
                                  // make it larger to slow down the animation

      s = new MergeSort(visualiser_delay);

      // This generates an array of N unique
      // integers from 0 to N-1s
      int N = 100;
      int numbers[] = new int[N];
      for(int i=0;i<N;i++) {
         numbers[i] = i;
      }

      // Seed the random number generator with the same
      // seed (so every thime this program is run, the
      // randomisation of the array is the same)
      Random r = new Random(0);

      for(int i=0;i<N;i++) {
        int j = r.nextInt(N);
        int tmp = numbers[i];
        numbers[i] = numbers[j];
        numbers[j] = tmp;
      }

      // Sort the array of integers
      s.sort(numbers);
   }
}