Find the Runner-Up Score!

  • + 3 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]])