Insertion sort

InsertionSort.java

package sort;

import java.util.Arrays;

public class InsertionSort { 

	public static void main( String[] args ){
		InsertionSort sort = new InsertionSort();
		int[] arr = {5,4,3,1,2};
		arr = sort.sort(arr);
		System.out.println( Arrays.toString(arr) ); 
	}

	private int [] sort( int[] arr ){
		int length = arr.length;
		int currPointer = 1;
		while( currPointer < length ){
			int tempPointer = currPointer;
			for( int i = currPointer-1; i>=0; i --  ){
				if( arr[tempPointer] < arr[i] ){
					swap( arr, tempPointer, i );
					tempPointer--;
				}else {
					break;
				}
			}
			currPointer++;
		}
		return arr;
	}


	private void swap(int[] arr, int currPointer, int i) {
		int t = arr[currPointer];
		arr[currPointer] = arr[i];
		arr[i] = t;
	}
}