This document discusses selection sort and bubble sort algorithms. It explains the selection sort algorithm, provides pseudocode, and analyzes its time complexity as O(n^2). It then compares the time complexity of selection sort and bubble sort, showing both have a worst-case performance of O(n^2). Finally, it asks how many problems the reader has solved and thanks them.

1. Week 3

3. Algorithms

5. Selection sort

7. for i from 0 to n-1
find smallest element between i'th and n-1'th
swap smallest with i'th element

8. Time for coding

12. repeat until no swaps
for i from 0 to n-2
if i'th and i+1'th elements out of order
swap them

13. Let's code

15. Break

17. Selection sort analysis

18. O

19. O(n
2
)
O(n log n)
O(n)
O(log n)
O(1)

20. O(n
2
)
O(n log n)
O(n)
O(log n)
O(1)

21. Ω

22. Ω(n2
)
Ω(n log n)
Ω(n)
Ω(log n)
Ω(1)

23. Ω(n2
)
Ω(n log n)
Ω(n)
Ω(log n)
Ω(1)

24. Bubble sort analysis

25. O

26. O(n
2
)
O(n log n)
O(n)
O(log n)
O(1)

27. O(n
2
)
O(n log n)
O(n)
O(log n)
O(1)

28. Ω

29. Ω(n2
)
Ω(n log n)
Ω(n)
Ω(log n)
Ω(1)

30. Ω(n2
)
Ω(n log n)
Ω(n)
Ω(log n)
Ω(1)

32. Visualize these algorithms

33. How many problems have you solved ?

36. Thanks