This project aims to implement and analyze various sorting algorithms. It provides a detailed performance analysis using different datasets to understand the efficiency of each sorting algorithm in various scenarios.
- Bubble Sort
- Heap Sort
- Insertion Sort
- Merge Sort
The project includes multiple datasets with random floating-point numbers to test and analyze the performance of the sorting algorithms. The datasets vary in size, ranging from 100 numbers to 10,000 numbers.
To run and test the algorithms:
- Navigate to the project directory.
- Run the
main.pyscript to execute the sorting algorithms and observe their performance.
This project is licensed under the MIT License. See the LICENSE file for more details.