Re: what type of sort is this?

I guess that I was thinking of insertion sort, because reverse ordered
is the opponent of that algorithm. Since shell sort is a modification
of insertion sort, perhaps that is where my bad estimate came from.

.

Relevant Pages

  • Re: Delete all items in the list
    ... It is useless for predicting how fast that algorithm will run, ... For what it's worth, for very small lists, the while...remove algorithm is ... insertion sort for small lists, only kicking off a high-overhead but O ...
    (comp.lang.python)
  • Re: Best method to sort a linked list (in my case)?
    ... >> Each node´s x and y coordinates in the linked list changes for every frame. ... wich sort algorithm do you recommend? ... i thought that insertion sort would work as a linked list is insertion ...
    (comp.lang.c)
  • Re: A Definition of an Algorithm
    ... the algorithms be written explicitly as primitive recursive functions ... doesn't match the usually meaning of algorithm, ... for one algorithm (insertion sort, say) to be written in many different ... see whether there is a counterexample to Fermat's Last ...
    (sci.math)
  • Re: How to demonstrate bigO cost of algorithms?
    ... > execution time) is PROPORTIONAL to n. ... insertion sort might be the fastest algorithm you have. ... Especially if reordering elements is expensive. ...
    (comp.lang.python)
  • Re: A Definition of an Algorithm
    ... the algorithms be written explicitly as primitive recursive functions ... doesn't match the usually meaning of algorithm, ... for one algorithm (insertion sort, say) to be written in many different ... the programmer would probably say that she ...
    (sci.math)