Slides for Computational Thinking (Chapter 5)
I just finished make slides for chapter 5 of Introduction to Computational Thinking that covers search and sorting algorithms.
The slides cover linear and binary search, insertion, selection and bubble sort, as well as bucket and radix sort. The chapter covers a little bit more, including how numbers are represented on a computer, and the consequences of this for bucket and radix sort.
You can get the slides here.
If you liked what you read, and want more like it, consider supporting me at Patreon.