Skip to content

Latest commit

 

History

History
22 lines (16 loc) · 845 Bytes

README.md

File metadata and controls

22 lines (16 loc) · 845 Bytes
Raw

Sorting Algorithms Analysis

Project Overview

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.

Implemented Algorithms

  • Bubble Sort
  • Heap Sort
  • Insertion Sort
  • Merge Sort

Datasets

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.

Usage

To run and test the algorithms:

  1. Navigate to the project directory.
  2. Run the main.py script to execute the sorting algorithms and observe their performance.

License

This project is licensed under the MIT License. See the LICENSE file for more details.