K Largest (temp)

Find k largest with temp Array

by Alex Myronov

Babel + JSX

const kLarge = (arr, k) => {
	const largest = []
	for (let i = 0; i < k; i++) {
  	largest.push(arr[i])
  }
  
  for (let ii = k; ii < arr.length; ii++) {
  	let minIndex = 0
    for (let j = 1; j < largest.length; j++) {
      if (largest[minIndex] > largest[j]) {
        minIndex = j
      }
    }
  
  	if (arr[ii] > largest[minIndex]) {
			largest[minIndex] = arr[ii]
    }
  }
  
  return largest
}

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