public static int[] biInsertSort(int[] data){
		int temp=0;
		int left=0;
		int right=0;
		for(int i=1; i<data.length;i++){
			
				left=0;
				right=i-1;
				while(left<right){
					int mid=(left+right)/2;
					if(data[mid]>data[i]){
						right=mid-1;
					}else{
						left=mid +1;
					}
				}
				
				temp =data[i];
				if(data[left]>temp){
					for(int j=i;j>left;j--){
						data[j]=data[j-1];
					}
					data[left]=temp;
				}else{
					for(int j=i;j>left+1;j--){
						data[j]=data[j-1];
					}
					data[left+1]=temp;
				}
				
							
				for(int k=0; k<data.length;k++)
					System.out.print(data[k]+",");
				System.out.println();
		}
		
		return data;
		
	}