Sorting algorithms/Bubble sort: Difference between revisions

<pre>

def bubblesort(seq):

for i in xrange(len(seq) - 2):

for j in range(i, len(seq) - 1):

if seq[j] > seq[j+1]:

seq[j], seq[j+1] = seq[j+1], seq[j]

data = [3, 78, 4, 23, 6, 8, 6]

bubblesort(data)

print data # [3, 4, 6, 6, 8, 23, 78]

</pre>

Python has a built in sort method, it's a quite modified Merge Sort called <b>Timsort</b>: http://py-stablesort.sourceforge.net/

<pre>

>>> foo = [3, 5, 2, 6, 1]

>>> sorted(foo)

[1, 2, 3, 5, 6]

>>> foo

[3, 5, 2, 6, 1]

>>> foo.sort()

>>> foo

[1, 2, 3, 5, 6]

</pre>