Talk:BFPRT

This redirect is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

This is wrong. The described algorithm is BFPRT not Quick Select.

Hi, did you mean that the algorithm is ALSO known as BFPRT or that the algorithm described is called BFPRT and quick select is a different algorithm? Cheers, --R.Koot 15:46, 11 October 2005 (UTC)[reply]

The later. QuickSelect is a different algorithm not based on groups of 5s, but on the pivot-selection step of quicksort.

I couldn't find anything under this name in Introduction to Algorithms and The Art of Computer Programming, which is a bit strange given what the acronym stands for and the authors of those books, but I trust you and Effiziente Algorithmen und Datenstrukturen so I moved it. --R.Koot 18:01, 13 October 2005 (UTC)[reply]