>Alright enough goofing around, lets see that Bubble Sort

def bs(A):
    for j in range(1,len(A)):
        for i in range(len(A)-j):
            if A[i] > A[i+1]:
                A[i],A[i+1] = A[i+1],A[i]

>>59830867
>*drops spaghetti*
>*runs out with noodles falling out of cargo shorts*
>*cry*

File: bubble.png (187KB, 473x491px) Image search: [Google]

187KB, 473x491px

>>59830867

>>59831034
Is that bubble sort? I thought bubble sort had to split an array in 2 recursively and then sort, or something like that, I can't remember.

>>59830867
When did I become an asian grill?

>>59831747
Sounds like you're confusing it with merge-sort.

>>59830867
I wouldn't worry. Judging from their looks the people behind that table don't know anything about decent code.

>>59831747

thats quicksort

File: 1489128178673.jpg (156KB, 1024x853px) Image search: [Google]

156KB, 1024x853px

>>59830867
>tfw had to implement merge sort in assembly

>>59831747
It "bubbles" them to the top.