recursive - revisited clear solution for Count Inversions by flpo - python coding challenges

Enable Javascript in your browser and then refresh this page, for a much enhanced experience.

recursive - revisited solution in Clear category for Count Inversions by flpo

def count_inversion(sequence):
    if not sequence: return 0 
    first, *rest = sequence
    return sum(x < first for x in rest) + count_inversion(rest)

May 2, 2019

List, list and list again

0 %

You ClassRoom Demo is Ready With the new tool CheckiO ClassRoom, you will be able to analyze your students' progress, have your own leaderboard, change missions order on the map, and so on.