Sorting 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
## Installation
Checks if a number is equal to 8
check if a array is sorted
Javascript library to translate Italian written numbers to its numeric value
Allows using plain primitive numbers in iteration.
Simple number utilities.
Shape any kind of value in JavaScript
Functional library for precise access to integer sequences such as prime numbers, square numbers, triangle numbers, etc
See if two integers (possibly large, like POSIX timestamps) are within the ballpark of each other. I'm using this to account for millisecond variations between start and an end datetimes. I.e. I want two POSIX timestamps to be within X minutes/hours of ea
Check whether a given number is a square.
This package provides a function to which you may pass any integet and it will return true if the given number is a prime number, false otherwise.
Checks if a number is not equal to 8
Remove all non-number characters and return a number. '$1,234' → 1234
Increase or decrease last decimal
math utilities
Fibonacci numbers for JavaScript
unique values generator
A library provides a framework unified for manipulating calendar stufs.