Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Fast sort? - Bubble Sort!? (Question to Dr. Hyatt)

Author: Dann Corbit

Date: 18:22:10 10/19/99

Go up one level in this thread


On October 19, 1999 at 21:07:04, Dave Gomboc wrote:
[snip]
>Looks like I spaced too...
>
>...but I _meant_ selection sort! ;-)
>
>
>Though I hear that insertion sort is very good for short lists in general,
>selection sort is better for chess stuff because we are not usually sorting all
>of the items, just the top 1-4 or so.
In which case you are not applying a sorting algorithm, but a *selection*
algorithm {specifically: select the top k items}



This page took 0 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.