Sign upLogin

comparison-sorting/heap-sort

View on GitHub
Star

Showing 3 of 3 total issues

Function dary has a Cognitive Complexity of 31 (exceeds 5 allowed). Consider refactoring.
Open

const dary = (arity) => {
    /**
     * Note that here we reverse the order of the
     * comparison operator since when we extract
     * values from the heap they can only be stored
Severity: Minor
Found in src/dary.js - About 4 hrs to fix

Cognitive Complexity

Cognitive Complexity is a measure of how difficult a unit of code is to intuitively understand. Unlike Cyclomatic Complexity, which determines how difficult your code will be to test, Cognitive Complexity tells you how difficult your code will be to read and comprehend.

A method's cognitive complexity is based on a few simple rules:

  • Code is not considered more complex when it uses shorthand that the language provides for collapsing multiple statements into one
  • Code is considered more complex for each "break in the linear flow of the code"
  • Code is considered more complex when "flow breaking structures are nested"

Further reading

Function dary has 45 lines of code (exceeds 25 allowed). Consider refactoring.
Open

const dary = (arity) => {
    /**
     * Note that here we reverse the order of the
     * comparison operator since when we extract
     * values from the heap they can only be stored
Severity: Minor
Found in src/dary.js - About 1 hr to fix

    Function sort has 42 lines of code (exceeds 25 allowed). Consider refactoring.
    Open

        const sort = (compare, a, i, j) => {
        // Construct the max-heap

        let k = i + 1;
    Severity: Minor
    Found in src/dary.js - About 1 hr to fix
      Severity
      Category
      Status
      Source
      Language