Computer Chess Club Archives

Search

Terms

Messages

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

Author: Dann Corbit

Date: 10:22:26 10/20/99

Go up one level in this thread

On October 20, 1999 at 10:21:04, Robert Hyatt wrote:
[snip]
>Right... but count the memory references.  My moves _must_ be put in the
>right array (the array where they are stuck when they are generated.)  This
>means that I copy them to another array, then 'insertion sort' them back to
>the original array, which copies each element twice.  Bubble sort eats that
>alive in terms of total instructions, number of memory references, and
>number of cache misses.  For very small N of course.

Insertion sort is stable and in-place.

This page took 0.01 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.