Re: Help me with references

Oliver Wong wrote:

> I'm not trying to tell the OP that implementing bubble sort is a good
> idea. All I was doing was pointing out that your statement "That algorithm
> will never be bubble sort." is not nescessarily true in all situations.
>
> If you're interested though, I can still answer the questions in your
> post.

I am interested. I can't think of any situation in which bubble sort is the
best choice for a sorting algorithm in a real machine.

In fact, I'm sure it never is.

--
Kenneth P. Turvey <kt@xxxxxxxxxxxxxxxxxx>
.

Relevant Pages

  • Re: Help me with references
    ... > about the problemspace that the general quicksort algorithm doesn't. ... but again you shouldn't choose bubble sort for these few cases. ... >> best choice for a sorting algorithm in a real machine. ...
    (comp.lang.java.help)
  • Re: Help me with references
    ... > best choice for a sorting algorithm in a real machine. ... Bubble sort is extremely well-performing for data that has a strong ... preordering (small amount of out-of-order elements). ...
    (comp.lang.java.help)
  • Re: VERY URGENT C PROGRAM
    ... put the values of the first matrix into an array, ... Bubble sort is never a good idea. ...
    (comp.lang.c)
  • Re: Help me with references
    ... > is the best choice for a sorting algorithm in a real machine. ... Bubble sort can sort "nearly sorted" data in almost linear time, ... it can identify a sorted list in linear time. ...
    (comp.lang.java.help)