Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Clear category for Count Inversions by szymonkukla1
def count_inversion(dane):
licznik = 0
for i in range(len(dane)):
m = len(dane) - 1
while(i < m):
if(dane[i] > dane[m]):
licznik += 1
m -= 1
return licznik
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. 6, 2016
