Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Clear category for Count Inversions by kisungch
def count_inversion(sequence):
count, sequence = 0, list(sequence)
while list(sequence)!=sorted(sequence):
for i, s in enumerate(sequence):
if sequence[i:i+2] != sorted(sequence[i:i+2]):
sequence = sequence[:i] + list(reversed(sequence[i:i+2])) + sequence[i+2:]
count += 1
return count
if __name__ == '__main__':
print("Example:");
print(count_inversion([1, 2, 5, 3, 4, 7, 6]));
#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"
print("Coding complete? Click 'Check' to review your tests and earn cool rewards!")
Aug. 23, 2023
Comments: