Computer Chess Club Archives


Search

Terms

Messages

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

Author: Dave Gomboc

Date: 18:07:04 10/19/99

Go up one level in this thread


On October 19, 1999 at 17:12:57, James B. Shearer wrote:

>On October 19, 1999 at 16:53:32, Bruce Moreland wrote:
>
>>On October 19, 1999 at 16:15:29, Dave Gomboc wrote:
>>
>>>Caveat: That sounded like an insertion sort to me, not a bubble sort.
>>
>>Sorry, I spaced.
>
>        Actually it's a selection sort.  First you select the largest element
>then the next largest element etc.
>        An insertion sort inserts the elements one after another.
>        Bubble sort is sort of an inefficient selction sort.
>                             James B. Shearer

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.

Dave



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.