Selection Revisited

(Jim Mischel) In Selecting the Top N Items from a Group, I showed how to use a binary heap to efficiently identify the N largest items from a large collection. Using a binary heap is much faster than the naive method, but it’s not the only way to do it and not necessarily the fastest, either.

Read More - Register for Free Membership