Insertion Sort

InsertionSort.java

package com.sorting.insert;
import static com.sorting.insert.SortUtils.*;

public class InsertionSort {

  public Comparable[] sort(Comparable[] items) {
		
		for (int i=0;i<items.length;i++){
			
			for (int j=i;j>0;j--){
				if (less (items[j],items[j-1])){
					exchange(items, j, j-1);
				}
				else{
					break;
				}
			}
			
		}
		
		return items;
		
		
	}

}