quickselect – Tarik Billa

QuickSelect Algorithm Understanding

December 20, 2023 by Tarik

The important part in quick select is partition. So let me explain that first. Partition in quick select picks a pivot (either randomly or first/last element). Then it rearranges the list in a way that all elements less than pivot are on left side of pivot and others on right. It then returns index of … Read more

Write a program to find 100 largest numbers out of an array of 1 billion numbers

September 29, 2022 by Tarik

You can keep a priority queue of the 100 biggest numbers, iterate through the 1 billion numbers. Whenever you encounter a number greater than the smallest number in the queue (the head of the queue), remove the head of the queue and add the new number to the queue. A priority queue implemented with a … Read more