Interesting algorithms & data structures on JavaScript.
Some of them (~ 40%) are my ideas in code. Other have been imported from great repository of Oleksii Trekhleb - https://github.com/trekhleb/javascript-algorithms
Current Version - 1.0.7
License - NSTU (Novosibirsk State Technical University)
You can try it on npm - https://www.npmjs.com/package/algostructum.js
Author: Slavus54 (Russia)
https://github.com/Slavus54
- import {Algostructum} from 'algostructum.js'
- const instance = new Algostructum()
-bit (num = 42) - convert an integer to binary number.
-euclidean (a = 1, b = 2) - find GCD of numbers.
-jump (arr = []) - own realization of greedy Jump Algorithm with other way to calculate distance;
returns an object {jumps, max, flag}. Time complexity - O(n)
-accuracy (body = '', arr = [], marker = 'x') - gain function with array of arguments and give away maximum of accuracy finded as product of (y / x) and y variable's fraction. Time complexity - O(n)
-fib (num = 0) - returns list of Fibonacci numbers.
-rainTerraces (arr = []) - gains an list of non-negative ints representing terraces in an elevation map where the width of each bar is 1, and counts how much water it is able to trap after raining.
-isProgression (arr = []) - checks if array of integers is progression and find math formulas (there are elements according them). Time complexity - O(log n)
-binarySearch (arr = [], element = null) - finds element of list and returns it in Divide and Conquer paradigm.
-indexSymmetry (arr = []) - gains and checking numbers of array by addition next and subtraction prev elements from current. Time complexity - O(n)
-middleLength (text = '', accuracy = 60) - returns length of text's middle word. Time complexity - O(n)
-pascalTriangle (lines = 0) - allows to build Pascal's Triangle by maximum line.
-levenshteinDistance (first = '', second = '') - compares strings and returns number of minimum symbol operations to make them equal.
-addDivisors (num = 1) - find all divisors of positive integer value and returns list of them. Time complexity - O(n)
-rhombus (num = 5) - builds rhombus array of numbers lists, which node is sequence of degree's number multiplied on element's position. Time complexity - O(n)
-qsort (arr = []) - best way to sort array of numbers created by Tony Hoare.
-recursiveStaircase (num = 1) - counts ways to reach the top by one or two steps.
-growth (num = 1, multiplier = 1) - returns result of number's multiplication on factorial of multiplier.
-insertionSort (arr = []) - returns sorted array of numbers, my favorite sorting algorithm.
-boxFilling (arr = []) - returns volume of filled square boxes with characteristics by each 3 array's numbers: 1 - height of left side, 2 - bottom, 3 - height of right side. Time complexity - O(n)
-bubbleSort (arr = []) - returns sorted array of numbers by swap greatest element of each pair.