Bubble Sort Algorithm?

In PHP it would look like this:

for ($i = 0; $i < count($arr); $i ++)

{

for ($j = $i + 1; $j < count($arr); $j ++)

{

if ($arr[$i] > $arr[$j])

{

$temp = $arr[$i];

$arr[$i] = $arr[$j];

$arr[$j] = $temp;

}

}

}

Do it your self:

Bubble-sort(L):

        for i from 0 to lenght(L) - 1:

                for j from 1 to lenght(L) - i - 1:

                        if L[j -1] and L[j] are in desorder:

                                swap L[j -1] and L[j]

Ok, ok, here is an example in Pyhton 3.0:

def bubblesort(L):

    for i in range(len(L)):

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

            if L[j - 1] > L[j]:

                (L[j - 1], L[j]) = (L[j], L[j - 1])

words = ["oh", "hi", "mark", "what", "a", "funny", "story"]

bubblesort( words )

print( words )

http://www.algolist.net/Algorithms/Sorting/Bubble_...

don't work or make it unnecessarily complicated?

bubble sort algorithm is very simple and very easy to implement