/*
 * SortTest.java
 *
 * Created on November 25, 2004, 5:12 PM
 */

/**
 *
 * @author  levenick
 */
import java.awt.*;
public class SortTest extends java.applet.Applet {
    MyIntArrayList theList;
    MyIntArrayList sorted;
    
    /** Initializes the applet SortTest */
    public void init() {
        initComponents();
        testBubbleSort();
        testInsertionSort();
    }
    
    public void initList() {
        theList.addElement(8);
        theList.addElement(3);
        theList.addElement(2);
        theList.addElement(1);
        theList.addElement(4);
    }
    
   private void testBubbleSort() {
        theList = new MyIntArrayList();
        initList();
        System.out.println("before bubblesorting, it's:" + theList);
        bubbleSort();
        System.out.println("after bubblesorting, it's:" + theList);
    }
    
    private void testInsertionSort() {
        theList = new MyIntArrayList();
        initList();
        System.out.println("before insertionsorting, it's:" + theList);
        insertionSort();
        System.out.println("after insertionsorting, it's:" + theList);
    }
    
    public void bubbleSort() {
        for (int pass=0; pass<theList.length(); pass++) {
            for (int look=0; look<theList.length()-1; look++) {
                if (theList.elementAt(look) > theList.elementAt(look+1)) 
                    swap(look, look+1);
            }
        } 
    }
    
    public void insertionSort() {      
        //create an empty list, called sorted 
        sorted = new MyIntArrayList();
        //for each element of unsorted
        for (int nextI=0; nextI<theList.length(); nextI++) {
            //find where it goes in sorted*
            int putHereIndex = findWhereToPutItIndex(theList.elementAt(nextI));
            //insert it there*
            sorted.addElementAt(theList.elementAt(nextI), putHereIndex); 
        } 
        
        theList = sorted;
    }
    
    public int findWhereToPutItIndex(int insertMe) {
        //for each element in sorted
        for (int here=0; here<sorted.length(); here++) {
            //if insertMe < current element
            if (insertMe < sorted.elementAt(here))
                //return location of current element
                return here;
        } 
        //return one past the end of the list (current >= all of them)
        return sorted.length();
    }
    
    public void inPlaceInsertionSort() {
        for (int here=0; here<theList.length()-1; here++) {
            swap(here, findMinIndex(here));
        } 
    }
    
    private int findMinIndex() {
        return findMinIndex(0);
    }
    
    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;
    }


    private void swap(int here, int there) {
        int pocket = theList.elementAt(there);
        theList.replaceElementAt(theList.elementAt(here), there);
        theList.replaceElementAt(pocket, here);
    }
    
    /** This method is called from within the init() method to
     * initialize the form.
     * WARNING: Do NOT modify this code. The content of this method is
     * always regenerated by the Form Editor.
     */
    private void initComponents() {//GEN-BEGIN:initComponents

        setLayout(new java.awt.BorderLayout());

    }//GEN-END:initComponents
    
    
    // Variables declaration - do not modify//GEN-BEGIN:variables
    // End of variables declaration//GEN-END:variables
    
}