S8 EP 2
How to build a community
Join us for our topical coding conversations every Wednesday at 9PM EST.
How was coding this week? Share your goals and your wins every Sunday at 2PM EST.
Vaidehi Joshi co-host, developer, author
Saron Yitbarek co-host, developer, founder
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.