Selection algorithm - Wikipedia, the free encyclopediaFirst Faved : Jul 19 2007 by mikeFaved : 1 time with noteViewed : 6 timesFave It!
Faves for this Web page
- mike - Jul 19 2007 | search, algorithms, selection
k-selection is O(n + k log k). I remember being astounded when I first learned this algorithm.
Already a user? Sign In
Add a Fave for this Web page
- What happens when I press Publish?
- Your Fave for this Web page gets shared with the Faves community. You can access it at any time by selecting "My Faves" from the menu above.
- Why do you ask for my email address?
- We use your email address to create an account, so you can easily find your Fave again at a later time.
Related Content from Around Faves
algorithms
-
1 FaverViewed: 4 TimesQuoted: The Fisher-Yates shuffle, named after Ronald Fisher and Frank Yates, also known as the Knuth shuffle, after Donald Knuth, is an algorithm for generating a random permutation of a finite set—in plain terms, for randomly shuffling the set.
- gutzeit - May 14 20071 FaverViewed: 13 Times
- mike - Jun 20 20081 FaverViewed: 2 Times
fisher
-
1 FaverQuoted: The Fisher-Yates shuffle, named after Ronald Fisher and Frank Yates, also known as the Knuth shuffle, after Donald Knuth, is an algorithm for generating a random permutation of a finite set—in plain terms, for randomly shuffling the set.
- gutzeit - May 14 20071 Faver
- mike - Jun 20 20081 Faver