Ranked #1
S6:E8 - "Meet our good friend PATRICIA"
S6:E8 - "Meet our good friend PATRICIA"
In this episode, we continue our talk on Radix Trees and introduce the Practical Algorithm To Retrieve Information Coded... Read more
19 Jun 2019
•
27mins
Ranked #2
S1:E2 - "What is encoding?"
S1:E2 - "What is encoding?"
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
9 Nov 2017
•
21mins
Ranked #3
S4:E7 - "Sorting the Michaels"
S4:E7 - "Sorting the Michaels"
Last week, we talked about two ways of classifying sorting algorithms: time complexity and space usage. This episode, we... Read more
12 Dec 2018
•
23mins
Ranked #4
S5:E7 - "A heap of heaps"
S5:E7 - "A heap of heaps"
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
27 Mar 2019
•
22mins
Ranked #5
S4:E6 - "It's sorting time!"
S4:E6 - "It's sorting time!"
You probably sort things all the time -- files, clothes, dishes. But have you thought about how to categorize your sorti... Read more
5 Dec 2018
•
24mins
Ranked #6
S7:E5 - "To b-tree or not to b-tree"
S7:E5 - "To b-tree or not to b-tree"
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
21 Aug 2019
•
16mins
Ranked #7
S1:E6 - "A friendly intro to Big O Notation"
S1:E6 - "A friendly intro to Big O Notation"
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
29 Nov 2017
•
33mins
Ranked #8
S1:E5 - "Linked Lists in Your Apartment"
S1:E5 - "Linked Lists in Your Apartment"
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
22 Nov 2017
•
23mins
Ranked #9
S5:E3 - "Sorting with insertion sort"
S5:E3 - "Sorting with insertion sort"
We dig into how insertion sort works, how we know where to do our inserting, and how this sorting algorithm performs, al... Read more
27 Feb 2019
•
19mins
Ranked #10
S2:E8 - "Let's get graphic"
S2:E8 - "Let's get graphic"
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
4 Apr 2018
•
31mins
Ranked #11
S7:E1 - "The AVL balancing act"
S7:E1 - "The AVL balancing act"
When you're dealing with data structures like trees, the balance of its "leaves" (data/nodes) matters. The moment a tree... Read more
24 Jul 2019
•
23mins
Ranked #12
S1:E3 - "Hex Queen"
S1:E3 - "Hex Queen"
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
15 Nov 2017
•
22mins
Ranked #13
S4:E2 - "Too many Brians at the (hash)table"
S4:E2 - "Too many Brians at the (hash)table"
School is in session, and the teacher is directing students to their assigned seat. Each unique name gets its own unique... Read more
7 Nov 2018
•
21mins
Ranked #14
S5:E5 - "Quick sort Queendom"
S5:E5 - "Quick sort Queendom"
We learn all about our second "divide and conquer" algorithm, quick sort! We walk through how it works with help from a ... Read more
13 Mar 2019
•
28mins
Ranked #15
S4:E8 - "The Saron Sort"
S4:E8 - "The Saron Sort"
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
19 Dec 2018
•
26mins
Ranked #16
S4:E3 - "Chaining to the rescue!"
S4:E3 - "Chaining to the rescue!"
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
14 Nov 2018
•
27mins
Ranked #17
S5:E8 - "Shrinking and growing heaps with cats"
S5:E8 - "Shrinking and growing heaps with cats"
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
3 Apr 2019
•
17mins
Ranked #18
S3:E7 - "Getting in line for breadth-first search"
S3:E7 - "Getting in line for breadth-first search"
We're going broad with breadth-first search! Well, actually, we're getting in line, or enqueuing ;) We walk through the ... Read more
3 Oct 2018
•
26mins
Ranked #19
S7:E4 - "A 2-3 tree for you and me"
S7:E4 - "A 2-3 tree for you and me"
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
14 Aug 2019
•
20mins
Ranked #20
S7:E3 - "Color me logarithmic!"
S7:E3 - "Color me logarithmic!"
In this episode, we are looking at a different type of self-balancing tree: red-black trees. By following four very impo... Read more
7 Aug 2019
•
23mins