# Julia Sample : GnomeSortfunctionGnomeSort(A)pos=1whilepos<length(A)+1if(pos==1)||(A[pos]>=A[pos-1])pos+=1elseA[pos],A[pos-1]=A[pos-1],A[pos]pos-=1endendreturnAend# Main CodeA=[16,586,1,31,354,43,3]println(A)# Original Arrayprintln(GnomeSort(A))# Gnome Sort Array
參考文獻
^Sarbazi-Azad, Hamid. Stupid Sort: A new sorting algorithm(PDF). Newsletter (Computing Science Department, Univ. of Glasgow). 2 October 2000, (599): 4 [25 November 2014]. (原始內容存檔(PDF)於2012-03-07).
^Paul E. Black. gnome sort. Dictionary of Algorithms and Data Structures. U.S. National Institute of Standards and Technology. [2011-08-20]. (原始內容存檔於2011-08-11).