2016 Update

Task/Sorting-algorithms-Bubble-sort/Julia/sorting-algorithms-bubble-sort.julia

@@ -1,25 +1,22 @@
-function bubblesort{T}(a::AbstractArray{T,1})
-    b = copy(a)
-    isordered = false
-    span = length(b)
-    while !isordered && span > 1
-        isordered = true
-        for i in 2:span
-            if b[i] < b[i-1]
-                t = b[i]
-                b[i] = b[i-1]
-                b[i-1] = t
-                isordered = false
-            end
-        end
-        span -= 1
+function bubblesort!{T}(x::AbstractArray{T})
+
+  for i in 2:length(x)
+    for j in 1:length(x)-1
+      if x[j] > x[j+1]
+          tmp = x[j]
+          x[j] = x[j+1]
+          x[j+1] = tmp
+      end
     end
-    return b
+  end
+
+  return x
 end
 
+
 a = [rand(-100:100) for i in 1:20]
 println("Before bubblesort:")
 println(a)
-a = bubblesort(a)
+a = bubblesort!(a)
 println("\nAfter bubblesort:")
 println(a)