You are viewing a single comment's thread. Return to all comments →

I always use my costum sort, you can try it. Also, a while seems better than a if+break. ...And you can do reversed(xrange(len(b)).

def qsort(A): if len(A)<=1: return A return qsort([x for x in A if x<A[0]])+[x for x in A if x==A[0]]+qsort([x for x in A if x>A[0]])

Can you pls explain how this works??

## Find the Runner-Up Score!

You are viewing a single comment's thread. Return to all comments →

I always use my costum sort, you can try it. Also, a while seems better than a if+break. ...And you can do reversed(xrange(len(b)).

Can you pls explain how this works??