Base.cs Podcast

In this episode, we continue our talk on Radix Trees and introduce the Practical Algorithm To Retrieve Information Coded... Read more

Binary is great for computers, but really tough for humans to work with. We need something that's a bit easier for us. T... Read more

Last week, we talked about two ways of classifying sorting algorithms: time complexity and space usage. This episode, we... Read more

What are heaps? How are they related to binary trees? We use losers, winners, and some cards to help us get to the botto... Read more

You probably sort things all the time -- files, clothes, dishes. But have you thought about how to categorize your sorti... Read more

In last episode, we talked about 2-3 trees, where the nodes of every tree contain data in the form of keys, as well as p... Read more

Big O Notation can be scary. But it doesn't have to be! We unpack this popular cs topic and show you how we can use it t... Read more

You may be familiar with arrays and hashes and variables, but how much do you know about linked lists? We dig into what ... Read more

We dig into how insertion sort works, how we know where to do our inserting, and how this sorting algorithm performs, al... Read more

Vaidehi loves graphs, and you will too! We end the season with an exploration of what they are, how to define them, and ... Read more

When you're dealing with data structures like trees, the balance of its "leaves" (data/nodes) matters. The moment a tree... Read more

Let's explore a very special number together: 16. It's the core of the hexadecimal system, and, in this episode, we'll l... Read more

School is in session, and the teacher is directing students to their assigned seat. Each unique name gets its own unique... Read more

We learn all about our second "divide and conquer" algorithm, quick sort! We walk through how it works with help from a ... Read more

We're at the end of the season! And to wrap things up, we're breaking down the last two ways to classify sorting algorit... Read more

We're back in our hash table classroom with our multiple Brians that need their own tables! But don't you worry, we've g... Read more

Now that you've got your heap, what do you do with it? Shrink and grow it of course! We talk about how to add and remove... Read more

We're going broad with breadth-first search! Well, actually, we're getting in line, or enqueuing ;) We walk through the ... Read more

We continue our discussion of tree data structures with 2-3 trees, where the nodes of every tree contain data in the for... Read more

In this episode, we are looking at a different type of self-balancing tree: red-black trees. By following four very impo... Read more