technology

k[]-th Radix Selection

Selection is an interesting algorithm related to sorting. k-th value Selection, provides the k-th largest value within an unsorted array of values without sorting the array. It does this in linear time, while using comparisons, which is faster than comparison sorting algorithms are capable of. Comparison-based Selection algorithm was developed over 50 years ago. Non-comparison […]

Read more "k[]-th Radix Selection"

Radix Selection Algorithm

There is a closely related algorithm to sorting called Selection, which provides the k-th element from an unsorted array. For example, a 17-th highest test score from a college Physics class, or a 91-st most popular book at the library. One way to accomplish Selection is to sort the array and then access the k-th […]

Read more "Radix Selection Algorithm"