combinations clear solution for Count Inversions by mplichta - python coding challenges

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

combinations solution in Clear category for Count Inversions by mplichta

from itertools import combinations

def count_inversion(sequence):
    return sum(a > b for a, b in combinations(sequence, 2))

March 26, 2018

Comments:

dan_s_4390f63070a942b1ad6c766d on July 3, 2022, 8:06 a.m.
<p>It's clear short decision. But I think itertools.combination() it's not good decision for list with more than 100k elements.</p>

mplichta on July 3, 2022, 8:53 a.m.
<p>yeah, maybe I didn't check anyhow performance or use some profiler to verify memory usage</p>

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.