insertion sort

by Akshay Jain

JavaScript

const a = [6,3,5,1,0,4,2];
function insertion_sort(arr) {
	for(let j = 1 ; j < arr.length; j++) {
  	console.log('sorted array', a.slice(0,j) + "", 'unsorted array', a.slice(j) + '');
    let key = arr[j];
    for(let i = j - 1; i >= 0;  i-- ) {
    console.log('inner loop iteration',i,j);
    	if(arr[i] > key) {
      	console.log('inside if',arr[i],key);
      	/* let k = arr[i+1] */;
        arr[i+1]= arr[i];
        arr[i]=key;
        console.log('1sorted array', a.slice(0,j) + "", 'unsorted array', a.slice(j) + '');
    
      }
    }

  }
}
insertion_sort(a);
console.log(a);