Rosetta Code

Sorting algorithms/Bubble sort: Difference between revisions

Page Discussion

Sorting algorithms/Bubble sort (view source)

Revision as of 23:49, 12 September 2007

11 bytes removed ,  16 years ago
More pythonic
(→‎[[Toka]]: Updated to work with Toka R1)
(More pythonic)
Line 310:
==[[Python]]==
[[Category:Python]]
<pre>
def bubblesortbubble_sort(seq):
for i in xrange(1, len(seq)):
while 1:
for j in range(len(seq) - i):▼
changed = if seq[j] > seq[j+1]:0
for i in xrange(len(seq[j],) seq[j+1]- = seq[j+1], seq[j]):
▲ for j in range(len(if seq)[i] -> seq[i)+1]:
seq[i], seq[i+1] = seq[i+1], seq[i]
data = [3, 78, 4, 23, 6, 8, 6]
changed = 1
bubblesort(data)
if not changed:
print data # [3, 4, 6, 6, 8, 23, 78]
break
</pre>
 
==[[Ruby]]==
Anonymous user
Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/7233"