June 2018 Update

Task/Sorting-algorithms-Gnome-sort/Julia/sorting-algorithms-gnome-sort.julia

@@ -1,12 +1,11 @@
-function gnomesort(A::AbstractVector)
-    i = 1
-    j = 2
-    while i < length(A)
-        if A[i] <= A[i + 1]
+function gnomesort!(arr::Vector)
+    i, j = 1, 2
+    while i < length(arr)
+        if arr[i] ≤ arr[i+1]
             i = j
             j += 1
         else
-            A[i], A[i + 1] = A[i + 1], A[i]
+            arr[i], arr[i+1] = arr[i+1], arr[i]
             i -= 1
             if i == 0
                 i = j
@@ -14,9 +13,8 @@ function gnomesort(A::AbstractVector)
             end
         end
     end
-    A
+    return arr
 end
 
-A = randcycle(20)
-println("unsorted: ", A)
-println("sorted:   ", gnomesort(A))
+v = rand(-10:10, 10)
+println("# unordered: $v\n -> ordered: ", bogosort!(v))