This project compares the time complexities of linear seach and binary search algorithms using C++. The aim is to demonstrate the efficiency differences between these two searching methods when handling large data sets.
-Implementation of linear search and binary search algorithm in C++. -Benchmark to measure the execution time for both algorithms.
- Clone the repository: git clone https://github.com/FluffyNumber1/C_Time_Complexity.git
Press run, and compare the results for a string that is in the beginning of the dataset, middle, and end.
This README was last updated on [10/3/2024].