https://github.com/huseynovvusal/boundit
🔍 JavaScript and TypeScript implementation of lower_bound and upper_bound for efficient data searching.
https://github.com/huseynovvusal/boundit
binary-search bisect javascript lower-bound typescript upper-bound
Last synced: 4 months ago
JSON representation
🔍 JavaScript and TypeScript implementation of lower_bound and upper_bound for efficient data searching.
- Host: GitHub
- URL: https://github.com/huseynovvusal/boundit
- Owner: huseynovvusal
- License: mit
- Created: 2025-01-28T20:55:59.000Z (over 1 year ago)
- Default Branch: master
- Last Pushed: 2025-01-28T21:11:31.000Z (over 1 year ago)
- Last Synced: 2026-01-15T13:37:20.526Z (5 months ago)
- Topics: binary-search, bisect, javascript, lower-bound, typescript, upper-bound
- Language: TypeScript
- Homepage: https://www.npmjs.com/package/boundit
- Size: 47.9 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Boundit
[](https://badge.fury.io/js/boundit) [](https://www.npmjs.com/package/boundit) [](https://github.com/huseynovvusal/boundit/blob/main/LICENSE)
🔍 JavaScript and TypeScript implementation of `lower_bound` and `upper_bound` for efficient data searching.
## Installation
You can install the package using npm:
```bash
npm install boundit
```
## Usage
### lowerBound
Returns the index of the first element in the array which is greater than or equal to the target.
```typescript
import { lowerBound } from "boundit"
const array = [1, 2, 4, 4, 5, 6]
const target = 4
const index = lowerBound(array, target)
console.log(index) // Output: 2
```
### upperBound
Returns the index of the first element in the array which is greater than the target, or the length of the array if no such element is found.
```typescript
import { upperBound } from "boundit"
const array = [1, 2, 4, 4, 5, 6]
const target = 4
const index = upperBound(array, target)
console.log(index) // Output: 4
```
### binarySearch
Binary search is a fast search algorithm with run-time complexity of O(log n). This search algorithm works on the principle of divide and conquer. For this algorithm to work properly, the data collection should be in the sorted form.
```typescript
import { binarySearch } from "boundit"
const array = [1, 2, 4, 4, 5, 6]
const target = 5
const index = binarySearch(array, target)
console.log(index) // Output: 4
```
## License
This project is licensed under the MIT License - see the [LICENSE](LICENSE) file for details.
## Contributing
Contributions are welcome! Please open an issue or submit a pull request for any changes.
## Author
Vusal Huseynov
## Links
- [Repository](https://github.com/huseynovvusal/boundit)
- [Issues](https://github.com/huseynovvusal/boundit/issues)
- [Readme](https://github.com/huseynovvusal/boundit#readme)