Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Uncategorized category for Count Inversions by mariano_italino
def count_inversion(sequence):
"""
Count inversions in a sequence of numbers
"""
result = 0
for i in range(len(sequence)):
for j in range(i + 1, len(sequence)):
if sequence[j] < sequence[i]:
result += 1
return result
if __name__ == '__main__':
#These "asserts" using only for self-checking and not necessary for auto-testing
assert count_inversion((1, 2, 5, 3, 4, 7, 6)) == 3 # "Example"
assert count_inversion((0, 1, 2, 3)) == 0 # "Sorted"
assert count_inversion((99, -99)) == 1 # "Two numbers"
assert count_inversion((5, 3, 2, 1, 0)) == 10 # "Reversed"
Jan. 26, 2016