package tarefa06;

public class KVector<Type extends Comparable<Type>> {
	Object[] vector;

	@SuppressWarnings("unchecked")
	KVector(){
		vector = new Object[2];
	}


	public void putSort(Type element) {
		boolean find = false;

		if (vector[0]==null){
			vector[0]=element;
			return;
		}

		if (element.compareTo((Type)vector[0])<0){
			moveAfter(0);
		}

		for (int i = (vector.length/2); find==false; ) {
			System.out.println(i);

			if (element.compareTo((Type)vector[i+1])>0 && element.compareTo((Type)vector[i])<0){
				moveAfter(i);
				vector[i+1]=element;
				find = true;
			}
			else if ((element.compareTo((Type)vector[i+1]) > 0) && (element.compareTo((Type)vector[i]) > 0)){
				i = i + i/2;
			}
			else {
				i/=2;
			}
		}
	}

	@SuppressWarnings("unchecked")
	private void moveAfter(int limit){
		Object[] temp = new Object[vector.length];

		if (vector.length>3){
			for(int i=0; i<limit; i++){
				temp[i] = vector[i];
			}

			for(int i=limit+1; i<temp.length; i++) {
				temp[i+2] = vector[i];
			}

			vector = temp;
		}

	}

	/* @Override
	public String toString() {
		String str = "";
		for (int i=0; i<vector.length; i++) {
			str = "aaaaaa " + (String)vector[i];
		}

		return str;
	}

	public void get (){
		for (int i = 0; i<vector.length; i++)
			System.out.println(vector[i]);
	} */
}