Sorting Algorithms (lab) and Time Testing (task)

This repository contains implementations of simple sorting algorithms and their time complexity and speed analysis

Algorithms Implemented

• Bubble Sort
• Selection Sort
• Merge Sort
• Python sorted()

Time Complexity

Expected time complexity of each sorting algorithm implemented:

• Bubble Sort: O(n^2)
• Selection Sort: O(n^2)
• Merge Sort: O(n log n)
• Python Sorted(): O(n log n)

How to Run

1. Clone the repository:

   git clone https://github.com/KarasTomas/Sorting-time-task.git

2. Navigate to the project directory:

   cd Sorting-time-task

3. Install the required dependencies:

   pip install -r requirements.txt

4. Run the unit tests to ensure the sorting algorithms work correctly:

   python .\tests\sorting_algorithms_test.py

5. Run the sorting algorithms and measure their performance:

   python sorting_time_task.py

Responsible pearson

Tomáš Karas email: [email protected]