Episode 4 - Quickselect

01/21/20 • 10 min

Today we're going to talk about quickselect. This algorithm helps us quickly find the n-th smallest element in unsorted arrays. It'll not only help you improve the performance of your applications, but it's also a very common white-board interview problem.

Previous Episode

Episode 3 - Partial Application (not Currying)

Today we'll discuss partial application and currying. By the end of the episode, you'll understand what these two different concepts are how they are different from each other, and where you can apply them in practice. In between the episode, we'll also talk about the brilliant computer scientist Haskell Curry, and we'll mention the Curry-Howard isomorphism

Next Episode

Episode 5 - Arrays and Linked Lists

In this episode, we'll discuss two fundamental data structures in computer science - arrays and linked lists. Their understanding is essential not only in your day to day job but also for performing well on your next coding interview. We'll discuss implementation details for both data structures, and we'll talk about when it's better to choose one instead of the other. Along the way, we'll touch on memory hierarchy, caching locality, and different interview problems.