BUBBLE SORT
	public void sort(T[] array, int leftIndex, int rightIndex) {
		if (leftIndex >= 0 && rightIndex < array.length){
			for (int i = leftIndex; i < rightIndex; i++){
				for (int j = i+1; j <= rightIndex; j++){
					if (array[i].compareTo(array[j]) == 1){
						Util.swap(array, i, j);
					}
				}
			}
		}
	}

SELECTION SORT
	public void sort(T[] array, int leftIndex, int rightIndex) {
		if (leftIndex >= 0 && rightIndex < array.length){
			for (int i = leftIndex; i < rightIndex; i++){
				int min = i;
				for (int j = i; j <= rightIndex; j++){
					if (array[min].compareTo(array[j]) == 1){
						min = j;
					}
				}
				Util.swap(array, min, i);
			}
		}
	}
INSERTION SORT
	public void sort(T[] array, int leftIndex, int rightIndex) {
		if (leftIndex >= 0 && rightIndex < array.length){
			for (int i = 1; i <= rightIndex; i++){
				int key = i;
				while ((key > 0) && (array[key].compareTo(array[key-1]) == -1)){
					Util.swap(array, key, key-1);
					key--;
				}
			}
		}
	}