Sorting algorithms/Bubble sort: Difference between revisions

Content added Content deleted

Inline

@@ Line 3,422: / Line 3,422: @@
 func bubbleSort A
-   n = len(A)
+     n = len(A)
-   while flag = 0
+     while flag = 0
-         flag = 1
+           flag = 1
-         for i = 1 to n-1
+           for i = 1 to n-1
-             if A[i] > A[i+1]
+               if A[i] > A[i+1]
-                temp = A[i]
+                  temp = A[i]
-                A[i] = A[i+1]
+                  A[i] = A[i+1]
-                A[i+1] = temp
+                  A[i+1] = temp
-                flag = 0
+                  flag = 0
-              ok
+                ok
-          next
+            next
-    end
+      end
 </lang>