Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
count_inversions1 solution in Clear category for Count Inversions by DJO3
def count_inversion(sequence):
"""
Count inversions in a sequence of numbers
"""
inversions = 0
for pos in range(len(sequence)):
for num in sequence[pos:]:
if num < sequence[pos]:
inversions += 1
return inversions
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"
April 28, 2015