Computer Chess Club Archives


Search

Terms

Messages

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

Author: James B. Shearer

Date: 14:12:57 10/19/99

Go up one level in this thread


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



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.