Sort array by bubbling up bigger values to the right side. Runtime: O(n^2)
published 1.1.1 4 years agoRemove an element in place from an array, if present.
published 2.0.1 4 years agoImmnutably remove an element from an array if it is present.
published 1.0.1 4 years agoReturns true if the predicate is satisfied for every element of the passed array; otherwise false.
published 1.2.1 4 years agoReturns true if the argument is a function; false otherwise.
published 1.0.1 4 years agoReturns true if the argument is a string; false otherwise.
published 1.0.1 4 years agoReturn the first element of an array where the callback returns true.
published 1.0.2 4 years agoReturn the index of the first element of an array where the callback returns true. Returns -1 if none do.
published 1.0.1 4 years agoRetrieve all elements in provided indexes array.
published 1.0.1 4 years agoReturns all indexes at which an element is found.
published 1.0.3 4 years agoSorting by insertion - Look for bigger numbers on the left side. Runtime: O(n^2). It starts from the 2nd element, and it tries to find any element (to the left) that could be bigger than the current index. It will move all the elements that are bigger and
published 1.0.1 4 years agoReturn the last element of an array where the callback returns true.
published 1.0.2 4 years agoLinear-time Partitioning. Runtime: O(n). Chooses a pivot and re-arrages the array so that everything on the left is <= pivot and everything on the right is > pivot
published 1.0.1 4 years agoEfficient in-place recursive sorting algorithm of numeric values. Avg. Runtime: O(n log n) | Worst: O(n^2)
published 1.0.1 4 years agoShuffle items in an array in-place. Runtime: O(n)
published 1.0.1 4 years agoCheck whether a condition is true for any element of an array. The condition check is in the form of a callback.
published 1.0.1 4 years agoGet an object property, with dot-notation support for deeply nested properties.
published 2.0.1 4 years ago