As a group project we are looking for an understanding regarding sorting algorithms by implementing, analyzing, and visualizing the performance of various sorting techniques in Python.
##Bubble Sort
- Time Complexity: O(n2)
- Space Complexity: O(1)
- Diagram methods...
##Merge Sort
- Time Complexity: O(n log n)
- Space Complexity: O(n)
##Quick Sort
- Time Complexity: O(n log n)
- Space Complexity: O(n2)
##Radix Sort
- Time Complexity: O(n*d)
- Space Complexity: O(n+k)
##Linear Search Algorithm
- Time Complexity: O(n)
- Space Complexity: O(1)
###Libraries Used:
-
Clone the Repository: Start by cloning this repository to your machine.
git clone <repository-url>
-
Set Up a Virtual Environment:
- Create a virtual environment.
python3 -m venv env
- Activate the virtual environment:
- On Windows:
.\env\Scripts\activate
- On macOS/Linux:
source env/bin/activate
- On Windows:
-
Install Dependencies:
- Navigate to the project directory and install the Python packages using
pip
:
pip install -r requirements.txt
- Navigate to the project directory and install the Python packages using
-
Run the Flask App:
- To start the Flask server, run the following command:
python app.py
- By default, the app runs on
http://127.0.0.1:5000
. Open this URL in your web browser to access the app.
-
Access the Application:
- Open your web browser and go to the default Flask server location: http://127.0.0.1:5000.