CAU Algorithms & Data Structures Project
Description
Implement Bubble Sort and Quick Sort in Python so that it sorts a data file of 100, 1000, and 10000 non-repeated random numbers. Find the time required to sort the dataset in Bubble Sort and Quick Sort. Repeat the sort 3 times, each time recording the time. Describe the background of both techniques and the code in a Powerpoint presentation. Compare the Max, Min, and Average sort times for Bubble Sort, and Quick Sort in a table and your conclusions and include it in your presentation.
Have a similar assignment? "Place an order for your assignment and have exceptional work written by our team of experts, guaranteeing you A results."
