Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Clear category for [old] Count Inversion by ShekhovtsovMaksym
"use strict";
function countInversion(sequence){
let counter = 0;
for (let i = 0; i < sequence.length; i++) {
for (let j = i; j < sequence.length; j++) {
if (sequence[j] < sequence[i]) {
counter++;
}
}
}
return counter;
}
var assert = require('assert');
if (!global.is_checking) {
console.log("Example:");
console.log(countInversion([1, 2, 5, 3, 4, 7, 6]));
assert.equal(countInversion([1, 2, 5, 3, 4, 7, 6]), 3, "Example");
assert.equal(countInversion([0, 1, 2, 3]), 0, "Sorted");
assert.equal(countInversion([99, -99]), 1, "Two numbers");
assert.equal(countInversion([5, 3, 2, 1, 0]), 10, "Reversed");
console.log("Coding complete? Click 'Check' to review your tests and earn cool rewards!");
}
Jan. 23, 2020
