June 2018 Update

Task/Sorting-algorithms-Selection-sort/Julia/sorting-algorithms-selection-sort.julia

@@ -1,21 +1,15 @@
-function selectionsort!{T<:Real}(a::Array{T,1})
-    len = length(a)
-    if len < 2
-        return nothing
-    end
+function selectionsort!(arr::Vector{<:Real})
+    len = length(arr)
+    if len < 2 return arr end
     for i in 1:len-1
-        (lmin, j) = findmin(a[i+1:end])
-        if lmin < a[i]
-            a[i+j] = a[i]
-            a[i] = lmin
+        lmin, j = findmin(arr[i+1:end])
+        if lmin < arr[i]
+            arr[i+j] = arr[i]
+            arr[i] = lmin
         end
     end
-    return nothing
+    return arr
 end
 
-a = [rand(-100:100) for i in 1:20]
-println("Before Sort:")
-println(a)
-selectionsort!(a)
-println("\nAfter Sort:")
-println(a)
+v = rand(-10:10, 10)
+println("# unordered: $v\n -> ordered: ", selectionsort!(v))