|
| 1 | +'use strict'; |
| 2 | +function heapify(arr, rootIndex, n) { |
| 3 | + let largetIndex = rootIndex; |
| 4 | + let leftIndex = (rootIndex * 2) + 1; |
| 5 | + let rightIndex = (rootIndex * 2) + 2; |
| 6 | + if (leftIndex < n && arr[largetIndex] < arr[leftIndex]) largetIndex = leftIndex; |
| 7 | + if (rightIndex < n && arr[largetIndex] < arr[rightIndex]) largetIndex = rightIndex; |
| 8 | + if (largetIndex != rootIndex) { |
| 9 | + let temp = arr[rootIndex]; |
| 10 | + arr[rootIndex] = arr[largetIndex]; |
| 11 | + arr[largetIndex] = temp; |
| 12 | + heapify(arr, largetIndex, n); |
| 13 | + } |
| 14 | +} |
| 15 | + |
| 16 | +function kSmallestElements(array, k) { |
| 17 | + // Build Max Heap of size K |
| 18 | + for (let index = parseInt(k / 2) - 1; index >= 0; index--) |
| 19 | + heapify(array, index, k); |
| 20 | + |
| 21 | + for (let index = k; index < array.length; index++) { |
| 22 | + if (array[0] > array[index]) { |
| 23 | + array[0] = array[index]; |
| 24 | + heapify(array, 0, k); |
| 25 | + } |
| 26 | + } |
| 27 | +} |
| 28 | + |
| 29 | +let array = [3, 5, 1, 8, 2, 4, 10, 12, 0, 7, 13, 16]; |
| 30 | +let k = 3; |
| 31 | +kSmallestElements(array, k); |
| 32 | +let kSmallestElementsStr = ''; |
| 33 | +for (let index = 0; index < k; index++) { |
| 34 | + if (index == (k - 1)) |
| 35 | + kSmallestElementsStr = kSmallestElementsStr + array[index]; |
| 36 | + else |
| 37 | + kSmallestElementsStr = kSmallestElementsStr + array[index] + ', '; |
| 38 | +} |
| 39 | +console.log(k, ' smallest elements are - ', kSmallestElementsStr); |
| 40 | +console.log(k + 'th smallest element is - ', array[0]); |
0 commit comments