https://github.com/hemanialaparthi/lvb
linear search vs binary search vs binary tree search
https://github.com/hemanialaparthi/lvb
binary-search-tree linear-search runtime-verification
Last synced: 9 months ago
JSON representation
linear search vs binary search vs binary tree search
- Host: GitHub
- URL: https://github.com/hemanialaparthi/lvb
- Owner: hemanialaparthi
- Created: 2025-04-03T17:31:27.000Z (10 months ago)
- Default Branch: main
- Last Pushed: 2025-04-18T04:11:30.000Z (10 months ago)
- Last Synced: 2025-04-18T16:52:44.503Z (10 months ago)
- Topics: binary-search-tree, linear-search, runtime-verification
- Language: Python
- Homepage:
- Size: 49.8 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Linear vs Binary Search Tree
## Overview
This project benchmarks the performance of various search algorithms, including linear search, binary search (iterative and recursive), and binary search tree (BST) search. It allows users to evaluate the efficiency of these algorithms on different data structures and datasets.
## Features
- Generate datasets of integers, floats, or strings.
- Support for unsorted lists, sorted lists, and binary search trees.
- Benchmark search algorithms:
- Linear Search
- Binary Search (Iterative and Recursive)
- Binary Search Tree Search
- Configurable dataset size, number of runs, and target selection.
## Requirements
- Python 3.8 or higher
- Dependencies:
- `typer` for command-line interface
- `rich` for rich text output
- `ruff` for linting (optional)
## Installation
1. Clone the repository:
```bash
git clone https://github.com/yourusername/lvb.git
```
2. Navigate to the project directory:
```bash
cd lvb
```
3. Install the required dependencies:
```bash
poetry install
```