/*
 * InsertionSort.java
 *
 * Created on April 13, 2005, 11:35 AM
 */

package sorttimer;

/**
 *
 * @author levenick
 */
public class InsertionSort extends AbstractSort {
    
    public void sort(IntList theList) { 
        this.theList = theList;
        for (int here=0; here<theList.length()-1; here++) {
            swap(here, findMinIndex(here));
        } 
    }
    
    private int findMinIndex(int startingIndex) {
        int minIndex = startingIndex;
        for (int look=startingIndex; look<theList.length(); look++) {
            if (theList.elementAt(look) < theList.elementAt(minIndex)) 
                minIndex = look;  // where is the biggest so far
        }
        return minIndex;
    }
    
    public String toString() {
        return "Insertion sort";
    }
}