This is part of my lecture course on Algorithms at the University of Cambridge.
Most of the sorting algorithms that enterprising beginners rediscover end up having quadratic complexity. By now we know this is sub-optimal so you should prefer better algorithms. We won’t spend much time on these, but it’s worth knowing about them. We saw insertsort in a previous video and here we explain selectsort, binary insertsort and bubblesort.
If you like my content, give it a thumbs up. Subscribe and hit the notification bell to be notified of new videos. This will encourage me to produce more videos for the benefit of aspiring computer scientists. You are welcome to comment below and to answer other people’s questions if you feel confident.
Course web page:
https://www.cl.cam.ac.uk/teaching/current/Algorithms/
Course handout:
https://www.cl.cam.ac.uk/teaching/2021/Algorithms/2020-2021-stajano-algs-handout.pdf
My home page:
https://www.cl.cam.ac.uk/~fms27/
Add comment