https://github.com/hawmex/aut_algorithm_design_foundations_project

This repository contains the files of my project for the "Algorithm Design Foundations" course at AUT (Tehran Polytechnic).
https://github.com/hawmex/aut_algorithm_design_foundations_project

benchmark benchmarking python search-algorithms

Last synced: 3 months ago
JSON representation

This repository contains the files of my project for the "Algorithm Design Foundations" course at AUT (Tehran Polytechnic).

• Host: GitHub
• URL: https://github.com/hawmex/aut_algorithm_design_foundations_project
• Owner: Hawmex
• License: mit
• Created: 2023-08-07T12:21:14.000Z (almost 2 years ago)
• Default Branch: main
• Last Pushed: 2024-03-28T10:57:43.000Z (over 1 year ago)
• Last Synced: 2025-02-12T07:22:31.388Z (5 months ago)
• Topics: benchmark, benchmarking, python, search-algorithms
• Language: Jupyter Notebook
• Homepage:
• Size: 4.36 MB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# Benchmarking Search Algorithms

This repository contains the files of my project for the "Algorithm Design

Foundations" course at Amirkabir University of Technology (Tehran Polytechnic).

## Studied Algorithms

1. Linear search

2. Jump search

3. Binary search

4. Ternary search

5. Interpolation search

6. Exponential search

7. Fibonacci search

8. Uniform binary search

## Results

![Linear Search](./screenshots/linear_raw.png)

![Jump Search](./screenshots/jump_raw.png)

![Binary Search](./screenshots/binary_raw.png)

![Ternary Search](./screenshots/ternary_raw.png)

![Interpolation Search](./screenshots/interpolation_raw.png)

![Exponential Search](./screenshots/exponential_raw.png)

![Fibonacci Search](./screenshots/fibonacci_raw.png)

![Uniform Binary Search](./screenshots/uniform_binary_raw.png)

![Smoothed Results](./screenshots/smoothed.png)

As we expected theoretically, we found that Linear Search has the worst

performance. And ternary search, binary search, and interpolation search perform

the best.