import java.util.Calendar;

public class InsertionSort {

	public long insertion_sort(int []x){
		Calendar befor=Calendar.getInstance();
		int temp=0,j=0;
		for(int i=1;i<x.length;i++){
			temp=x[i];
			for(j=i;j>0;j--){

				if(x[j-1]<temp)
					x[j]=x[j-1];
				else {
					break;
				}
			}
		x[j]=temp;
		}
		Calendar after=Calendar.getInstance();
		return (after.getTimeInMillis()-befor.getTimeInMillis());
	}
}