Talk:Sorting algorithms/Gnome sort: Difference between revisions

: How I can understand it now: the previous C version was simply the ''original'' Gnome sort as explained in the Dick Grune citation on Wikipedia (the garden gnome moves always one step forward or backward); the pseudocode is an optimized version, since we don't need to pass through every pot to reach the same position we left when started to go backward; so we can restart from j instead of 1. --[[User:ShinTakezou|ShinTakezou]] 20:37, 27 April 2009 (UTC)

:: Third thought (too many distraction sorry): it's true it's an optimization, but not the rest. When the gnome hits the beginning of the list (i==0), elements 0 and 1 are in the proper order, so that if we put i=1, the next iteration will execute the "true part" of the if, i.e. i=j and j++; ... doing it directly in the "then part" of the if, will avoid an extra comparing we know will be true. This optimization apart, it was really the same. --[[User:ShinTakezou|ShinTakezou]] 20:54, 27 April 2009 (UTC)