Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Parentheses everywhere!! solution in Clear category for Count Inversions by new_hoschi
def count_inversion(sequence):
# inner sum: for a fixed index j count the number of elements with smaller
# value than j in the tail list sequence[j:]
# outer list: simply sum the values for all indices j and you get the solution
# (toughest part is typing of parentheses ;))
return sum([sum([i
April 14, 2020
Comments:
