Smallest K Elements from array (Selection Rank Algorithm)
Find smallest k elements from array using selection rank algorithm.
Solution:
- There are various ways to find smallest k elements
- Using sorting
- Using Max Heap
- Using selection rank algorithm (implemented below)
Latest Source Code:
Github: ShuffleCardOfDeck.java
Output:
Array: [10, 8, 12, 8, 2, 3, 12, 5] 5 smallest array: [5, 2, 3, 8, 8]