Straight Insertion Sort

StraightInsertionSort.java

public class StraightInsertionSort {

	/*insertionsort
	Description: Performs a insertion sort on a given list

	Parameters: 
			int[] list: array of integers to be sorted	
	Pre: Initialized array      
	Post: Sorted array
	Returns:  Sorted array
	Called by: Any
	Calls:   None
	*/
	public static int[] insertionsort(int[] list)
	{
		int i, k, y;
		
		for( k = 1; k < list.length; k++)
		{
			y = list[k];
			
			for( i = k-1; i >= 0 && y < list[i]; i--)
			{
				list[i+1] = list[i];
			}
			list[i+1] = y;
		}
		
		return list;
	}
}