K Largest (without temp arr)

Find k largest without using temp Array

by Alex Myronov

Babel + JSX

const kLarge = (arr, k) => {
  for (let i = k; i < arr.length; i++) {
  	let minIndex = 0

		for (let j = 1; j < k; j++) {
    	if (arr[j] < arr[minIndex]) {
      	minIndex = j
      }
    }
    
    if (arr[i] > arr[minIndex]) {
    	const temp = arr[minIndex]
      arr[minIndex] = arr[i]
      arr[i] = temp
    }
  }
  
  return arr.slice(0, k)
}

console.log(kLarge([1, 23, 12, 9, 30, 2, 50], 3))