Base.cs Podcast-logo

Base.cs Podcast

Technology News >

More Information

Location:

United States

Twitter:

@CodeNewbies

Language:

English


Episodes

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 Digital Ocean and Linode for sponsoring this season of the show!

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 Digital Ocean and Linode for sponsoring this season of the show!

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 Digital Ocean and Linode for sponsoring this season of the show!

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 Digital Ocean and Linode for sponsoring this season of the show!

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 Digital Ocean and Linode for sponsoring this season of the show!

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 Digital Ocean and Linode for sponsoring this season of the show!

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 Digital Ocean and Linode for sponsoring this season of the show!

Duration:00:24:23

S5:E1 - "The simple selection sort"

2/13/2019
More
What is selection sort? How does this algorithm work? And just as importantly, how does it perform? We use broken books and cookies to tell you all about it! Based on Vaidehi Joshi's blog post, "Exponentially Easy Selection Sort". A huge thank you to Digital Ocean and Linode for sponsoring this season of the show!

Duration:00:23:16

S4:E8 - "The Saron Sort"

12/19/2018
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 algorithms: recursive vs. non-recursive and comparison vs. non-comparison. We bring it all together to talk about what we can do with all these classifications, and, in true basecs podcast fashion, we bring in seemingly unrelated topics like tomatoes! Based on Vaidehi Joshi's blog post, "Sorting Out The Basics Behind Sorting Algorithms". A huge thank you to Twilio and Digital...

Duration:00:26:24

S4:E7 - "Sorting the Michaels"

12/12/2018
More
Last week, we talked about two ways of classifying sorting algorithms: time complexity and space usage. This episode, we dig into two more! We explore how algorithms can be internal or external, and what "stability" means for a sorting algorithm. And we do it all with the help of cards, clovers, and a pair of Michaels. Based on Vaidehi Joshi's blog post, "Sorting Out The Basics Behind Sorting Algorithms". A huge thank you to Twilio and Digital Ocean for sponsoring this season of the show!

Duration:00:23:52

S4:E6 - "It's sorting time!"

12/5/2018
More
You probably sort things all the time -- files, clothes, dishes. But have you thought about how to categorize your sorting? How do your sorting algorithms hold up in terms of, say, time complexity? We give you an introduction to sorting algorithms, what they are and what they're used for, and dig into the six ways we can classify them. Based on Vaidehi Joshi's blog post, "Sorting Out The Basics Behind Sorting Algorithms". A huge thank you to Twilio and Digital Ocean for sponsoring this...

Duration:00:24:34

S4:E5 - "Sets, sets, everywhere"

11/28/2018
More
Sets are everywhere! If you've worked with relational databases, made a venn diagram, maybe touched some relational algebra, then you've already worked with sets. We talk about why they're so common, how well they perform (time for some Big O Notation!), and how they're actually implemented. Based on Vaidehi Joshi's blog post, "Set Theory: the Method To Database Madness". A huge thank you to Twilio and Digital Ocean for sponsoring this season of the show!

Duration:00:25:12

S4:E4 - "Varon explains set theory"

11/21/2018
More
Set theory might sound like a scary, super-math thing, but it's not! Well, it is a math thing, but it doesn't have to be super scary. In fact, if you already know how venn diagrams work, then you basically already know set theory. We'll walk you through it all and show you how it connects back to computer science with the help of our favorite foods. Based on Vaidehi Joshi's blog post, "Set Theory: the Method To Database Madness". A huge thank you to Twilio and Digital Ocean for sponsoring...

Duration:00:18:27

S4:E3 - "Chaining to the rescue!"

11/14/2018
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 got a brand new collision resolution called chaining to help us out. We talk about how it works and how it compares to linear probing. Based on Vaidehi Joshi's blog post, "Taking Hash Tables Off The Shelf". A huge thank you to Twilio and Digital Ocean for sponsoring this season of the show!

Duration:00:27:08

S4:E2 - "Too many Brians at the (hash)table"

11/7/2018
More
School is in session, and the teacher is directing students to their assigned seat. Each unique name gets its own unique table. But there's an unexpected student in the class. There's another Brian! What do we do?! In this episode, we dig into how to manage these collisions in a hashtable, and how to use our collision resolution strategy to find new Brian his own desk. Based on Vaidehi Joshi's blog post, "Taking Hash Tables Off The Shelf". A huge thank you to Twilio and Digital Ocean for...

Duration:00:21:08

S4:E1 - "Gotta hash 'em all"

10/31/2018
More
We're kicking off a new season with a brand new topic: hash tables! This episode is full of bookshelves, pizza toppings, and helpful fridge operators who are teaming up to give you the most gentle (and the most fun) introduction to the world of hash tables. Based on Vaidehi Joshi's blog post, "Taking Hash Tables Off The Shelf". A huge thank you to Twilio and Digital Ocean for sponsoring this season of the show!

Duration:00:25:22

S3:E8 - "BFS is your BFF"

10/10/2018
More
Let's break down how breadth-first search (BFS) actually works! We'll walk through a real example, explain the Big O notation of this algorithm, and explore how you might decide whether to use breadth-first search or depth-first search. Based on Vaidehi Joshi's blog post, "Breaking Down Breadth-First Search". A huge thank you to Twilio for sponsoring this season of the show!

Duration:00:25:16

S3:E7 - "Getting in line for breadth-first search"

10/3/2018
More
We're going broad with breadth-first search! Well, actually, we're getting in line, or enqueuing ;) We walk through the steps of how breadth-first search (BFS) works, complete with holiday themed analogies and reindeers that need a GPS. We also compare and contrast the steps of BFS to those in DFS (depth-first search). Based on Vaidehi Joshi's blog post, "Breaking Down Breadth-First Search". A huge thank you to Twilio for sponsoring this season of the show!

Duration:00:26:34

S3:E6 - "Drowning in DFS"

9/25/2018
More
In our final look at depth-first search (DFS), we explore how to implement this lovely algorithm in coding terms. We also dig into Big O notation, breaking down how to determine the time and space complexity of DFS. Based on Vaidehi Joshi's blog post, "Demystifying Depth-First Search". A huge thank you to Twilio for sponsoring this season of the show!

Duration:00:27:57

S3:E5 - "When the washing machine's 'Inorder'"

9/19/2018
More
Let's dig into another depth-first search strategy: in-order! This time, we walk through a numerical example, traversing the tree with fresh, animated voices and a broken washing machine. And when you're done learning all about inorder, take our postorder challenge! Tweet us the output of a postorder strategy applied to this binary search tree. Make sure to use the #basecs hashtag, and no cheating! :D Based on Vaidehi Joshi's blog post, "Demystifying Depth-First Search". A huge thank you to...

Duration:00:24:17