Sorting algorithms/Bubble sort: Difference between revisions

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

edits