// DrJava saved history v2
int[] x = new int[]{5,5,5,5,5,5,5,5};
Sorting.selectionSort(x)
int[] x = new int[]{5,5,5,5,5,5,5,5};
Sorting.selectionSort(x)
x = new int[]{5,5,5,5,5,5,5,5};
Sorting.insertionSort(x)
int[] y = new int[]{9,8,7,6,5,4,3,2,1};
Sorting.selectionSort(y)
y = new int[]{9,8,7,6,5,4,3,2,1};
Sorting.insertionSort(y)
y = new int[]{20,19,18,17,16,15,14,13,12,11,10,9,8,7,6,5,4,3,2,1};
Sorting.insertionSort(y)
Sorting.insertionSort(y)
y = new int[]{20,19,18,17,16,15,14,13,12,11,10,9,8,7,6,5,4,3,2,1};
Sorting.selectionSort(y)
y = new int[]{9,8,7,6,5,4,3,2,1};
Sorting.selectionSort(y)
y = new int[]{9,8,7,6,5,4,3,2,1};
Sorting.insertionSort(y)
int[] z = new int[]{1,2,3,4,5,6,7,8,9};
Sorting.selection(z)
Sorting.selectionSort(z)
z = new int[]{1,2,3,4,5,6,7,8,9};
Sorting.insertionSort(z)
// Help session with Levon
java HiQ
java HiQ "C:\Program Files\drjava\"
int[] x = new int[]{2,2,2,2,2};
Sorting.selectionSort(x)
Sorting.insertionSort(x)

// For this example, insertion sort is more efficient
// than selection sort.
x = new int[]{2,2,2,2,2,2,2,2,2,2,2,2,2};
Sorting.insertionSort(x)
Sorting.selectionSort(x)

// Insertion sort performs better on this one too!
x = new int[]{1,2,3,4,5,6,7,8,9};
Sorting.selectionSort(x)
Sorting.insertionSort(x)

// For this example, insertion has more swaps,
// selection has more comparisons.
// Which one to use depends on how "costly" it is to
// perform these operations.
x = new int[]{9,8,7,6,5,4,3,2,1};
Sorting.insertionSort(x)
Sorting.selectionSort(x)
Sorting.binarySearch(new int{1,2,3,4,5}, 3)
Sorting.binarySearch(new int[]{1,2,3,4,5}, 3)
Sorting.binarySearch(new int[]{1,2,3,4,5}, 6)