https://github.com/codewithdark-git/aoa---analysis-of-algorithms
AOA - Analysis of Algorithms
https://github.com/codewithdark-git/aoa---analysis-of-algorithms
Last synced: 5 months ago
JSON representation
AOA - Analysis of Algorithms
- Host: GitHub
- URL: https://github.com/codewithdark-git/aoa---analysis-of-algorithms
- Owner: codewithdark-git
- License: mit
- Created: 2025-02-26T17:45:32.000Z (12 months ago)
- Default Branch: main
- Last Pushed: 2025-03-05T14:39:18.000Z (12 months ago)
- Last Synced: 2025-03-06T13:41:44.004Z (12 months ago)
- Language: Jupyter Notebook
- Size: 4.88 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Algorithm Analysis Tool
This tool analyzes and visualizes the time and space complexity of different sorting algorithms.
## Features
- Implementation of Bubble Sort and Selection Sort algorithms
- Time complexity analysis
- Space complexity analysis
- Visualization using matplotlib
## Requirements
- Python 3.x
- matplotlib
- numpy
## Usage
Run the script using:
```bash
python algorithm_analysis.py
```
This will generate two plots:
1. Time Complexity Analysis - showing how execution time grows with input size
2. Space Complexity Analysis - showing how memory usage grows with input size
## Understanding the Graphs
- The x-axis represents the input size (n)
- For time complexity: y-axis shows execution time in seconds
- For space complexity: y-axis shows memory usage in KB