See On Github

Wikipedia Description

Gnome sort (or Stupid sort ) is a sorting algorithm originally proposed by Dr. Hamid Sarbazi-Azad (Professor of Computer Engineering at Sharif University of Technology ) in 2000 and called stupid sort (not to be confused with bogosort ), and then later on described by Dick Grune and named gnome sort from the observation that it is how a gnome sorts a line of flower pots. It is a sorting algorithm which is similar to insertion sort, except that moving an element to its proper place is accomplished by a series of swaps, as in bubble sort. It is conceptually simple, requiring no nested loops. The average, or expected, running time is O ( n 2 ), but tends towards O ( n ) if the list is initially almost sorted. In practice the algorithm can run as fast as insertion sort. [ citation needed ] The algorithm always finds the first place where two adjacent elements are in the wrong order, and swaps them. It takes advantage of the fact that performing a swap can introduce a new out-of-order adjacent pair only next to the two swapped elements. It does not assume that elements forward of the current position are sorted, so it only needs to check the position directly previous to the swapped elements.

comparison sort, exchange sort, stable sort