Suggestion for sort

[goyalyashpal]

In the "CS50 2021/2022 - Lecture 3 - Algorithms" , in section of "Sort Race" at the end,
Order of running time came out to be: Merge sort < Selection sort < Bubble sort

• Here, I think more cautionary light can be shed on why selection sort performed faster than bubble sort.
• Similar to how the caution was shared at the end of "CS50 2021 Lecture" for the numerical imprecision.

With content something like given below:
(sorry, this ain't related to "Source code for CS50's lectures" ; but lectures... i couldn't think of other place to suggest this)

---

2:00:29 it's worth noting that

• even though it seemed that selection sort is doing more steps (1:11:05), but it is actually performing faster than bubble sort!

why?

• 'cz the actual steps selection sort is performing in inner loop take less time individually...
• it's O(n) comparisons, but exactly one swap per pass of the inner loop.

But in a single run of inner loop in bubble sort:

• there were O(n) comparisons, as well as O(n) swaps.
• So, that contributed to increased runtime of bubble sort
• This is more getting into the weeds, but something you should be aware of while designing and analysing algorithms

[duffouroppong]

Is been nice being around .