Javascript Insertion Sort

by stevenkaspar

JavaScript

let insertionSort = arr => {
  let sorted_arr = []
  for(let i = 0; i < arr.length; i++){
  	let i_val = arr[i]
    if(i === 0){
      sorted_arr.push(i_val)
    }
    let inserted = false
    for(let i2 = 0; i2 < sorted_arr.length; i2++){
      if(sorted_arr[i2] > i_val){
        inserted = true
      	sorted_arr.splice(i2, 0, i_val)
        break
      }
    }
    if(!inserted){
      sorted_arr.push(i_val)
    }
  }
  return sorted_arr
}

console.log(insertionSort([3,2,5,1,4,7,8,4,9]))