Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Uncategorized category for Count Inversions by Albert.Nowak
def count_inversion(sequence):
dl=len(sequence)
i=0
n=1
pom=0
tmp=0
for i in range(dl):
for n in range(i,dl):
if sequence[i]>sequence[n]:
pom+=1
return pom
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"
Dec. 14, 2015
