Base.cs Podcast-logo

Base.cs Podcast

Education Podcasts >

More Information

Location:

United States

Twitter:

@CodeNewbies

Language:

English


Episodes

S7:E5 - "To b-tree or not to b-tree"

8/21/2019
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 potential child nodes, and can contain more than one key. This takes us to b-trees, which is a generalized version of the 2-3 tree, and are super efficient for storing data in an indexed database, like MySQL. Based on Vaidehi Joshi's blog post, "Busying Oneself With B-Trees". A huge thank you to Square for sponsoring this season of the show!Join us for Codeland, our...

Duration:00:16:49

S7:E4 - "A 2-3 tree for you and me"

8/14/2019
More
We continue our discussion of tree data structures with 2-3 trees, where the nodes of every tree contain data in the form of keys, as well as potential child nodes. Not only that, but it can contain MORE THAN ONE KEY. They are also the -key- to what we'll be talking about next episode, B-trees, and you won't tree-lieve how cool those are. Based on Vaidehi Joshi's blog post, "Busying Oneself With B-Trees". A huge thank you to Square for sponsoring this season of the show!Join us for Codeland,...

Duration:00:20:01

S7:E3 - "Color me logarithmic!"

8/7/2019
More
In this episode, we are looking at a different type of self-balancing tree: red-black trees. By following four very important rules while we paint our tree red and black, we can make it not only self-balancing, but also make it run super efficiently in logarithmic time. Based on Vaidehi Joshi's blog post, "Painting Nodes Black With Red-Black Trees". A huge thank you to Square for sponsoring this season of the show!Join us for Codeland, our conference celebrating all things code. Tickets here

Duration:00:23:24

S7:E2 - "Stay gold, AVL tree, stay gold."

7/31/2019
More
Last episode, we learned about AVL trees, a type of self-balancing binary search tree that follows a golden rule: no single leaf in the tree should have a significantly longer path from the root node than any other leaf on the tree. In this episode, we learn about a pattern that we can use to programmatically figure out the minimum number of nodes we’ll need to create any given height-balanced AVL tree, which leads us to the Fibonacci sequence, and relates to the "golden ratio" you might...

Duration:00:18:09

S7:E1 - "The AVL balancing act"

7/24/2019
More
When you're dealing with data structures like trees, the balance of its "leaves" (data/nodes) matters. The moment a tree becomes unbalanced, it loses its efficiency, much like a real life tree bending to the weight of one side, unable to efficiently stand tall and grab the light of the sun. Don't let your garden grow full of lopsided saplings, and make sure to plant some AVL trees--your efficient runtime hangs in the balance. Based on Vaidehi Joshi's blog post, "The Little AVL Tree That...

Duration:00:23:22

S6:E8 - "Meet our good friend PATRICIA"

6/19/2019
More
In this episode, we continue our talk on Radix Trees and introduce the Practical Algorithm To Retrieve Information Coded In Alphanumeric trees, also known as PATRICIA trees. Yeah, I think we'll just stick with calling them PATRICIA trees. Based on Vaidehi Joshi's blog post, "Compressing Radix Trees Without (Too Many) Tears". A huge thank you to Linode and Square for sponsoring this season of the show!Join us for Codeland, our conference celebrating all things code. Tickets here

Duration:00:27:09

S6:E7 - "The cannibalistic efficiency of radix trees"

6/12/2019
More
In this episode, join us as we adventure into the safari that is radix trees, where parent nodes eat their offspring nodes as they chomp them down and compress. Don't worry, with all of this new added space in the trie(b), they'll more efficiently keep their children's memory alive. Based on Vaidehi Joshi's blog post, "Compressing Radix Trees Without (Too Many) Tears". A huge thank you to Linode and Square for sponsoring this season of the show!Join us for Codeland, our conference...

Duration:00:22:36

S6:E6 - "Dear tries, you (auto)complete me"

6/5/2019
More
In this episode we continue our talk on pies and tries, and how this data structure is used to power such things as auto-complete! Based on Vaidehi Joshi's blog post, "Trying to Understand Tries". A huge thank you to Linode and Square for sponsoring this season of the show!Join us for Codeland, our conference celebrating all things code. Tickets here

Duration:00:22:55

S6:E5 - "Tries: the golden retriever of data structures"

5/29/2019
More
In this episode we go through some trie-als and tribulations to retrieve and build words using tries! Based on Vaidehi Joshi's blog post, "Trying to Understand Tries". A huge thank you to Linode and Square for sponsoring this season of the show!Join us for Codeland, our conference celebrating all things code. Tickets here

Duration:00:19:15

S6:E4 - "Radix sort: the patient zero of sorting algorithms "

5/22/2019
More
This episode we're diving into radix sort! The word has no relation to Raid, so it is definitely non-toxic and you don't have to bug out. It IS, however, a great integer sorting algorithm, and the first one at that! Based on Vaidehi Joshi's blog post, "Getting To The Root Of Sorting With Radix Sort". A huge thank you to Linode and Square for sponsoring this season of the show!Join us for Codeland, our conference celebrating all things code. Tickets here

Duration:00:27:28

S6:E3 - "You can count on counting sort"

5/15/2019
More
You may have noticed that it's really hard to sort things efficiently. Well, that's where counting sort comes in! Based on Vaidehi Joshi's blog post, "Counting Linearly With Counting Sort". A huge thank you to Linode and Square for sponsoring this season of the show!Join us for Codeland, our conference celebrating all things code. Tickets here

Duration:00:29:30

S6:E2 - "Getting to the bottom of the heap...sort."

5/8/2019
More
We've gotten acquainted with heaps as arrays, now we're diving into heap sort with some help from a few condiments! Based on Vaidehi Joshi's blog post, "Heapify All The Things With Heap Sort". A huge thank you to Linode and Square for sponsoring this season of the show!Join us for Codeland, our conference celebrating all things code. Tickets here

Duration:00:24:34

S6:E1 - "Heaps as arrays"

5/1/2019
More
So we've talked about heaps, but how do you represent heaps as arrays? And why would you want to? We break it down step by step! Based on Vaidehi Joshi's blog post, "Learning to Love Heaps". A huge thank you to Linode and Square for sponsoring this season of the show!Join us for Codeland, our conference celebrating all things code. Tickets here

Duration:00:17:25

S5:E8 - "Shrinking and growing heaps with cats"

4/3/2019
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 values from a heap with the help of a few cats. Based on Vaidehi Joshi's blog post, "Learning to Love Heaps". A huge thank you to Linode and Square for sponsoring this season of the show!Join us for Codeland, our conference celebrating all things code. Tickets here

Duration:00:17:12

S5:E7 - "A heap of heaps"

3/27/2019
More
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! Based on Vaidehi Joshi's blog post, "Learning to Love Heaps". A huge thank you to Linode and Square for sponsoring this season of the show!Join us for Codeland, our conference celebrating all things code. Tickets here

Duration:00:22:02

S5:E6 - "The big O of quicksort"

3/20/2019
More
How does quicksort perform? And how do variables, like the pivot number, affect it? We walk through three examples to find out! Based on Vaidehi Joshi's blog post, "Pivoting To Understand Quicksort [Part 2]". A huge thank you to Linode and Square for sponsoring this season of the show!Join us for Codeland, our conference celebrating all things code. Tickets here

Duration:00:28:56

S5:E5 - "Quick sort Queendom"

3/13/2019
More
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. Based on Vaidehi Joshi's blog post, "Pivoting To Understand Quicksort [Part 1]". A huge thank you to Linode and Square for sponsoring this season of the show!Join us for Codeland, our conference celebrating all things code. Tickets here

Duration:00:28:58

S5:E4 - "Merge sort stops the suckage"

3/5/2019
More
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. Based on Vaidehi Joshi's blog post, "Making Sense of Merge Sort ". A huge thank you to Linode and Square for sponsoring this season of the show!Join us for Codeland, our conference celebrating all things code. Tickets here

Duration:00:25:59

S5:E3 - "Sorting with insertion sort"

2/27/2019
More
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. Based on Vaidehi Joshi's blog post, "Inching Towards Insertion Sort". A huge thank you to Linode and Square for sponsoring this season of the show!Join us for Codeland, our conference celebrating all things code. Tickets here

Duration:00:19:07

S5:E2 - "What's bubble sort?"

2/20/2019
More
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. Based on Vaidehi Joshi's blog post, "Bubbling Up With Bubble Sorts". A huge thank you to Linode and Square for sponsoring this season of the show!Join us for Codeland, our conference celebrating all things code. Tickets here

Duration:00:24:23