/* Well this is a trial.........
   A insertion sort that just looks and sees what the story is
   James Little 10/4/01

*/

package jlittle_ex8;
import java.util.*;

public class Insertion {

    public void sort(Vector man){
	Word [] a = new Word [man.size()];

	for (int i=0; i<man.size(); i++){
	    a[i]=(Word)man.elementAt(i);
	}

	String guide=null;
	for (int i=0; i<a.length; i++){
	    Word value = a[i];

	    if(value.getReal().compareTo(guide)<0){
	    int j;
		for(j=i-1; j >=0 && a[j].getReal().compareTo(value.getReal())>0; j--){
		    a[j+1]=a[j];
		}
	    a[j+1]=value;
	    }
	    if (value.getReal().compareTo(guide)>0) guide=value.getReal();
	}

	for (int i=0; i<man.size(); i++){
	    man.setElementAt(a[i],i);
	}
    }
    public boolean check(int a[]){
	int guide=0;
	boolean done = true; // lets be optimists
	for (int i=0; i<a.length; i++){
	    int value = a[i];
	    if (value>=guide);
	    else if (guide>value){
		i=a.length-1;
		done=false;
	    }
	    else System.out.println("Why is this being printed?");
	    guide=value;
	}
	return done;
    }
    public boolean invert(int a[]){
	int guide=a[a.length-1];
	boolean done = true; // lets be optimists
	for (int i=a.length-1; i>=0; i--){
	    int value = a[i];
	    if (value>=guide);
	    else if (guide>value){
		i=-1;
		done=false;
	    }
	    else System.out.println("Why is this being printed?");
	    guide=value;
	}
	return done;
    }
    public void right(int a[]){
	int n  = a.length-1;
	int temp=0;
	for (int i=0; i<(a.length/2); i++){
	    if(a[i]>a[n-i]){
		temp=a[i];
		a[i]=a[n-i];
		a[n-i]=temp;
	    }
	}

    }
    
}