Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Uncategorized category for Count Inversions by Anna_Barys
def count_inversion(sequence):
S = 0
for x in range(0, len(sequence)-1):
a = sequence[x]
for y in range(x+1, len(sequence)):
b = sequence[y]
if a < b:
w = 0
else:
w = 1
S = S + w
print(S)
return S
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. 1, 2016
