Skip to content

This project provides a basic comparison of four distinct search algorithms, demonstrating their performance across varying input sizes.

Notifications You must be signed in to change notification settings

Abhinaykotla/search-algorithms-comparison

Repository files navigation

Search Algorithm Performance Comparison

This project provides a basic comparison of four distinct search algorithms, demonstrating their performance across varying input sizes. The project is implemented in Python and includes the following algorithms:

  1. Linear Search
  2. Binary Search (within a sorted array)
  3. Binary Search Tree
  4. Red-Black Tree

Project Setup

Follow these instructions to get a local copy of the project and set it up for testing.

Requirements

  • Python 3.6 or newer

Installation

  1. Clone or download the project to your local machine.
  2. Open a terminal and navigate to the project directory.
  3. Install the necessary Python packages using the following command:
pip install -r requirements.txt

Running the tests

  1. Open terminal and navigate to the project directory
  2. Run the following command to run the tests
python main.py

About

This project provides a basic comparison of four distinct search algorithms, demonstrating their performance across varying input sizes.

Topics

Resources

Stars

Watchers

Forks

Languages