1. lab no 10
comparison of bubble and quick sort
(space and time complexity)
Ayan Alam
Luqman
Mujeeb

2. Aim
• the fundamental purpose of this lab is to compare the functionality of
two different algorithm with respect to time and space complexity
•Apparatus:
• laptop
• spyder
• python 3.8.0
•procedure
• I try to sort my list using two algorithms of sort: bubble and quick
• For this purpose i used algorithms module and bubble_sort , quick_sort respectively. As I know
complexity of first algorithm is n^2 and second is n*log(n).

3. input code