Talk:Gnome sort

From Wikipedia, the free encyclopedia

	This article is within the scope of WikiProject Computer science, which aims to create a comprehensive computer science reference for Wikipedia. Visit the project page for more information and to join in on related discussions.
Start	rated as start-Class on the assessment scale
Mid	rated as mid-importance on the assessment scale

Contents 1 Implementation transwiki 2 Same as insertion sort? 3 Garden Gnome? 4 Python example

[edit] Implementation transwiki

I've been told that Wikipedia is not the place for excessive code implementations, and I'm inclined to agree. Where would the the proper place to which all this code should be transwikied? ~ Booyabazooka 22:42, 11 May 2006 (UTC)

Nowhere. The pseudocode is small and pretty straightforward. So I'll go ahead and remove the implementations. If anyone disagrees, please post here the reason and revert it back. DanielKO 01:35, 12 July 2006 (UTC)

Hi. I have been going through pages like this and reimplementing the pseudocode in Python. If the end result is easier to understand, as it was in this case, I have replaced the pseudocode with Python. If you think the pseudocode was better, you can go ahead and put it back. Jesin (talk) 02:18, 27 November 2007 (UTC)

Aloha. Why is the only version now in Java? Unless anyone has any objections, I'll be reverting to the Python/Pseudocode implementation (Probably pseudocode). Wikipedia isn't (usually) the place for specific implementations, but rather for the general version. 212.159.30.215 (talk) 17:07, 22 January 2008 (UTC)

[edit] Same as insertion sort?

Hmm, the optimisation included in the psuedocode (... and not part of the original algorithm I might add) appears to make gnome sort perform identical to insertion sort. Watch it in a visualizer if you don't believe me, I cannot pick the difference between them. =/ ? Themania 17:00, 13 May 2007 (UTC)

Yes, gnome sort and insertion sort are simply described in a different method, and are completely identical. In my opinion. (Oh, by the way, this is User:Goffrie, too lazy to login.) 4.20.175.132 23:49, 2 July 2007 (UTC)

they are identical. instead of sequence of swaps with temp insertsort uses only one temp. gnomesort does this a <=> b <=> c <=> until a is in proper place.... insert sort does this temp <= a, a<= b <= c <= .... x <= temp . User:cc.aa.ll 84.16.123.194 19:34, 1 December 2007 (UTC)

[edit] Garden Gnome?

How can a garden gnome, which is not a real thing, have a methodology for sorting flower pots? How could this real algorithm be based on such a fictional algorithm? This does not make very much logical sense. Nimur 07:03, 21 October 2007 (UTC)

[edit] Python example

Is it really needed? It is almost the same as the pseudo code.AV-2 (talk) 09:56, 17 March 2008 (UTC)