Search results

10 packages found

M
Q
P
M
Q
P

Binary sorted array. Implements array initialization, insertion, finding index of element, item removal, clearing the array.

published 1.0.4 7 years ago
M
Q
P

a collection of algorithms written in typescript

published 1.0.2 6 years ago
M
Q
P

An implementation of John von Neumann's sorted arrays in JavaScript. Implements insertion sort and binary search of JavaScript objects for fast insertion and deletion.

published 1.0.0 11 years ago
M
Q
P

Simple function `binaryInsert(array, value, comparator)` that provides binary insert functionality for a **sorted** array in javascript. This is mostly intended for larger arrays, and the performance gain may be viewed in the [benchmark](#benchmarks).

published 1.2.1 4 years ago
M
Q
P

Sorted Array - uses binary search for fast insertion / reading

published 1.0.16 2 years ago
M
Q
P

ShellOsort uses the cuts 1, 1, 3, 12, 64, 405, 3312, 44370, 2209839, 623492664 and insertion sort to sort sub-arrays which match for the different cuts

published 0.0.3 6 years ago
M
Q
P

Merge Sort algorithm implementation without recursion, using cached binary trees

published 0.0.3 3 years ago
M
Q
P

It is a binary tree that is balanced automatically when node insertion or removal takes place.

published 1.0.4 3 years ago
M
Q
P