https://github.com/shadowfaxx1/improved-parakeet
analysis of different sorts with their time implementing time graph for various number of objects using different langauges
https://github.com/shadowfaxx1/improved-parakeet
Last synced: 2 months ago
JSON representation
analysis of different sorts with their time implementing time graph for various number of objects using different langauges
- Host: GitHub
- URL: https://github.com/shadowfaxx1/improved-parakeet
- Owner: shadowfaxx1
- License: mit
- Created: 2022-06-24T10:57:37.000Z (almost 3 years ago)
- Default Branch: main
- Last Pushed: 2023-06-13T08:27:23.000Z (almost 2 years ago)
- Last Synced: 2025-01-26T08:41:42.117Z (4 months ago)
- Language: Python
- Size: 10.7 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# 
Improved Parakeet is a project aimed at analyzing various sorting algorithms and their time complexity by implementing them on different numbers of objects. The project provides valuable insights into the performance of sorting algorithms and their efficiency for varying input sizes. The analysis includes popular sorting algorithms such as Quicksort, Mergesort, Insertion Sort, Heapsort, and Selection Sort.
## Features
- **Sorting Algorithms**: Improved Parakeet implements different sorting algorithms to analyze their performance. This includes Quicksort, Mergesort, Insertion Sort, Heapsort, and Selection Sort. These algorithms are chosen for their different time complexities and approaches to sorting.
- **Time Complexity Analysis**: The project measures the execution time of each sorting algorithm for varying numbers of objects. It provides a graphical representation of the time taken to sort different input sizes, allowing users to observe the time complexity of each algorithm.
- **Multiple Programming Languages**: The project supports multiple programming languages such as Python, C, and C++. This allows users to compare the performance of sorting algorithms implemented in different languages and observe any variations in execution time.
## Usage
1. Clone the Improved Parakeet repository to your local machine.
2. Choose the programming language you want to use for the analysis (Python, C, or C++).
3. Navigate to the corresponding language folder in the repository.
4. Select the sorting algorithm you want to analyze.
5. Compile and run the code using the appropriate compiler or interpreter for the chosen language.
6. The program will automatically generate a graph showing the time taken to sort varying numbers of objects using the selected algorithm.
7. Analyze the graph to observe the time complexity of the sorting algorithm for different input sizes.
8. Repeat the steps for other sorting algorithms or programming languages to compare their performance.
## Contribution
Contributions to the Improved Parakeet project are welcome. If you have any suggestions, additional sorting algorithms, or improvements to the existing code, please feel free to contribute by raising an issue or submitting a pull request on the project's GitHub repository.
Let Improved Parakeet assist you in understanding the time complexity of various sorting algorithms and their performance characteristics across different programming languages. Gain valuable insights into the efficiency of sorting algorithms and make informed decisions when choosing the right algorithm for your specific needs!