package sort;

import java.util.*;
import java.text.*;

public class SearchSortTester {

    private static Random rand = new Random();
    private static DecimalFormat fmt = new DecimalFormat(".000");

    public static void main(String[] args) {
        System.out.println("SearchSortTester written by S. Robbins");
        int[] intArray1 = Utility.makeIntArray(10);
        Double[] doubleArray1 = Utility.makeDoubleArray(10);
        int[] intArray2 = Utility.cloneArray(intArray1);
        Double[] doubleArray2 = Utility.cloneArray(doubleArray1);
        Utility.show(intArray1);
        System.out.println("Linear search for " + intArray1[3] + " gives "
                + Search.linearSearch(intArray1, intArray1[3]));
        System.out.println("Linear search for 307 gives "
                + Search.linearSearch(intArray1, 307));
        Utility.show(doubleArray1);
        System.out.println("Linear search for " + Utility.format(doubleArray1[3]) + " gives "
                + Search.linearSearch(doubleArray1, doubleArray1[3]));
        System.out.println("Linear search for .307 gives "
                + Search.linearSearch(doubleArray1, .307));
        System.out.print("Before selection sort: ");
        Utility.show(intArray1);
        QuadraticSort.selectionSort(intArray1);
        System.out.print("After selection sort:  ");
        Utility.show(intArray1);
        System.out.print("Before insertion sort: ");
        Utility.show(intArray2);
        QuadraticSort.insertionSort(intArray2);
        System.out.print("After insertion sort:  ");
        Utility.show(intArray2);
        System.out.print("Before selection sort: ");
        Utility.show(doubleArray1);
        QuadraticSort.selectionSort(doubleArray1);
        System.out.print("After selection sort:  ");
        Utility.show(doubleArray1);
        System.out.print("Before insertion sort: ");
        Utility.show(doubleArray2);
        QuadraticSort.insertionSort(doubleArray2);
        System.out.print("After insertion sort:  ");
        Utility.show(doubleArray2);
        System.out.println();
        Utility.show(intArray1);
        System.out.println("Binary search for " + intArray1[3] + " gives "
                + Search.binarySearch(intArray1, intArray1[3]));
        System.out.println("Binary search for 307 gives "
                + Search.binarySearch(intArray1, 307));
        Utility.show(doubleArray1);
        System.out.println("Binary search for " + Utility.format(doubleArray1[3]) + " gives "
                + Search.binarySearch(doubleArray1, doubleArray1[3]));
        System.out.println("Binary search for .307 gives "
                + Search.binarySearch(doubleArray1, new Double(.307)));
        
        System.out.println("\nSearch Times:");
        System.out.println(Utility.timeSearchHeader());
        System.out.println(Utility.timeSearch(100));
        System.out.println(Utility.timeSearch(1000));
        System.out.println(Utility.timeSearch(10000));
        System.out.println(Utility.timeSearch(100000));
        System.out.println(Utility.timeSearch(1000000));
        System.out.println(Utility.timeSearch(10000000));
        System.out.println(Utility.timeSearch(10000000));
        
        System.out.println("\nSort Times:");
        System.out.println(Utility.timeSortHeader());
        System.out.println(Utility.timeSort(10));
        System.out.println(Utility.timeSort(100));
        System.out.println(Utility.timeSort(1000));
        System.out.println(Utility.timeSort(10000));
        System.out.println(Utility.timeSort(20000));
        System.out.println(Utility.timeSort(40000));
        System.out.println(Utility.timeSort(80000));
        System.out.println(Utility.timeSort(100000));
        System.out.println(Utility.timeSort(200000));
        System.out.println("\nAll Tests Done");
        
    }

}