Groups > comp.lang.python > #20402

Re: name of a sorting algorithm

From	Mel Wilson <mwilson@the-wire.com>
Newsgroups	comp.lang.python
Subject	Re: name of a sorting algorithm
Followup-To	comp.lang.python
Date	2012-02-14 10:25 -0500
Organization	Aioe.org NNTP Server
Message-ID	<jhducq$kui$1@speranza.aioe.org> (permalink)
References	<mailman.5800.1329231688.27778.python-list@python.org>

Followups directed to: comp.lang.python

Show all headers | View raw

Jabba Laci wrote:
> Could someone please tell me what the following sorting algorithm is
> called?
> 
> Let an array contain the elements a_1, a_2, ..., a_N. Then:
> 
for i in xrange (N-1):
    for j in xrange (i, N):
        if a[j] < a[i]:
            a[i], a[j] = a[j], a[i]
> 
> It's so simple that it's not mentioned anywhere. I guess it's called
> "selection sort" but I'm not sure. The minimum selection sort is an
> improvement of this one.

It's what Wikipedia says a selection sort is: put the least element in [0], 
the least of the remaining elements in [1], etc.

	Mel.

Thread

name of a sorting algorithm Jabba Laci <jabba.laci@gmail.com> - 2012-02-14 16:01 +0100
  Re: name of a sorting algorithm Mel Wilson <mwilson@the-wire.com> - 2012-02-14 10:25 -0500
    RE: name of a sorting algorithm "Prasad, Ramit" <ramit.prasad@jpmorgan.com> - 2012-02-14 15:50 +0000
      RE: name of a sorting algorithm Mel Wilson <mwilson@the-wire.com> - 2012-02-14 11:44 -0500
        RE: name of a sorting algorithm "Prasad, Ramit" <ramit.prasad@jpmorgan.com> - 2012-02-14 20:21 +0000
        RE: name of a sorting algorithm "Prasad, Ramit" <ramit.prasad@jpmorgan.com> - 2012-02-14 20:13 +0000
  Re: name of a sorting algorithm Ulrich Eckhardt <ulrich.eckhardt@dominolaser.com> - 2012-02-14 16:33 +0100

csiph-web