Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Uncategorized category for Count Inversions by capback250
def count_inversion(text):
"""
Count inversions in a sequence of numbers
"""
i = 0
counter = 0
while i < len(text):
temparr = text[i:]
tempi = text[i]
for letter in temparr:
if tempi > letter:
counter += 1
i += 1
return counter
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"
Aug. 1, 2015
