Assignment#2
BSSE/EE
Date29/3/21
Deadline:5/4/21
Q1. Consider the following array:
1 7 8 6 4 5 6 2 3 0
You have been through 6-7 different sorting techniques. Here you are required to apply
bubble sort, selection sort and insertion sort on above array and find time complexity of
each algorithm. Sort array in ascending order for all.
You can solve your assignment either in MS Word or hand written, if hand written, you have
to take shots of it, make one pdf file and submit as a single file.
Note: You all need to submit your assignment to your CR not later than 10am (5/4/21)
Save your file with your registration number, don’t forget to write your name, reg, date and
assignment number over front page.
Dear CR, don’t accept any late assignment and submit to me accordingly.