Sorting algorithms/Bubble sort: Difference between revisions

Content added Content deleted

Inline

@@ Line 1,864: / Line 1,864: @@
 =={{header|Julia}}==
 <lang Julia>
-function bubblesort{T}(a::AbstractArray{T,1})
+function bubblesort!{T}(x::AbstractArray{T})
-    b = copy(a)
+  for i in 2:length(x)
-    isordered = false
-    span = length(b)
+    for j in 1:length(x)-1
-    while !isordered && span > 1
+      if x[j] > x[j+1]
-        isordered = true
+          tmp = x[j]
-        for i in 2:span
+          x[j] = x[j+1]
-            if b[i] < b[i-1]
+          x[j+1] = tmp
-                t = b[i]
+      end
-                b[i] = b[i-1]
-                b[i-1] = t
-                isordered = false
-            end
-        end
-        span -= 1
     end
+  end
-    return b
+  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)