Fast partial sorting algorithm
Posted
by
trican
on Stack Overflow
See other posts from Stack Overflow
or by trican
Published on 2012-11-09T10:28:25Z
Indexed on
2012/11/09
11:01 UTC
Read the original article
Hit count: 358
I'm looking for a fast way to do a partial sort of 81 numbers - Ideally I'm looking to extract the lowest 16 values (its not necessary for the 16 to be in the absolutely correct order).
The target for this is dedicated hardware in an FPGA - so this slightly complicated matters as I want the area of the resultant implementation as small as possible. I looked at and implemented the odd-even merge sort algorithm, but I'm ideally looking for anything that might be more efficient for my needs (trade algorithm implementation size for a partial sort giving lowest 16, not necessarily in order as opposed to a full sort)
Any suggestions would be very welcome Many thanks
© Stack Overflow or respective owner