Base.cs Podcast

Heapify all the things!

We dig into how heaps are presented as arrays.

We talk about how to add and remove values from a heap with the help of a few cats.

What are heaps? How are they related to binary trees? We use losers, winners, and some cards to help us get to the bottom of heaps!

How does quicksort perform? And how do variables, like the pivot number, affect it? We walk through three examples to find out!

We learn all about our second divide and conquer algorithm, quick sort! We walk through how it works with help from a queendom, a few pointers, and a very helpful pivot number.

Finally, a sorting algorithm that doesn't suck! We explore how merge sort works and why it performs better than insertion, bubble, and selection sort.

We dig into how insertion sort works, how we know where to do our inserting, and how this sorting algorithm performs, all with the help of our new boos.

We are super bubbly about bubble sort! We dig into our second sorting algorithm and break down how it works and why it's actually not a great way of sorting things.

What is selection sort and how does it work? We use broken books and cookies to tell you all about it!