Searching And Sorting Arrays | Episode 10 | Programming With Shadow

In today's video, we look some more a basic array operations such as sorting and searching. For this, we discuss Linear Search, Binary Search, and Bubble Sort. We also talk a little about complexity analysis. Finally, I also hurriedly convert my testing area into a small program with a terminal menu.

One mistake in this lesson is that I originally describe the wrong sorting algorithm. For some reason, I thought of a Selection Sort rather than than a Bubble Sort. I correct myself when I go to thinking about the algorithm; however, my initial explanation is wrong.

Finally, the button I was looking for on the Windows Calculator is 2nd which allows you to create a log with an arbitrary base. For some reason I couldn't find it when I was looking. Basically the shortcut I took is that one thousand log base 2 is approximately 10, one million is approximately 20, one billion is approximately 30. So I used a quick approximation I had learned. The calculator does have that function however.

Видео Searching And Sorting Arrays | Episode 10 | Programming With Shadow канала ShadowB5