Published Jun 25, 2018

Algorithms You Should Know

Joe Zack and Alan Underwood dissect essential algorithms, focusing on tree and graph traversal strategies, the importance of Big O notation for data complexity, and detailed insights into sorting algorithms, providing a comprehensive guide to mastering these technical essentials.

Episode Highlights

Topics covered

Episode Highlights

Related Episodes

What is Algorithmic Complexity?
Answers 383 questions
Graph Algorithms
Answers 383 questions
88. Algorithmic Complexity
Answers 383 questions
Data Structures - Arrays and Array-ish
Answers 383 questions
95. Data Structures – Arrays and Array-ish
Answers 383 questions
89. Does Big O Matter?
Answers 383 questions
Data Structures - (some) Trees
Answers 383 questions
Data Structures - Heaps and Tries
Answers 383 questions
What Should You Learn Next?
Answers 383 questions
Clean Code - How to Write Classes the Right Way
Answers 383 questions
Show Recursion Show
Answers 383 questions
Stack Overflow 2022 Survey Says …
Answers 383 questions
How to be a Programmer
Answers 383 questions
Understanding Complexity Theory
Answers 383 questions
Is Kubernetes Programming?
Answers 383 questions

Dexa/Coding Blocks

Algorithms You Should Know

Topics covered

Popular Clips

Selection Sort Analysis

Sorting Algorithm Breakdown

Pivot Point Logic

Exciting Updates

Pointer vs. Recursion

Essential Algorithms Unveiled

Inefficient Bubble Sort

Collaborative Software Development

Sorting Algorithms Insight

Infinite Data Dilemma

Link Sharing

Heap Sort Stability

Understanding Logarithmic Time

Graph Complexity Insights

Mastering Bubble Sort

Episode Highlights

Tree and Graph Algorithms

Data Analysis and Complexity

Sorting Algorithms

Related Episodes

What is Algorithmic Complexity?

Graph Algorithms

88. Algorithmic Complexity

Data Structures - Arrays and Array-ish

95. Data Structures – Arrays and Array-ish

89. Does Big O Matter?

Data Structures - (some) Trees

Data Structures - Heaps and Tries

What Should You Learn Next?

Clean Code - How to Write Classes the Right Way

Show Recursion Show

Stack Overflow 2022 Survey Says …

How to be a Programmer

Understanding Complexity Theory

Is Kubernetes Programming?

Algorithms You Should Know

Topics covered

Popular Clips

Episode Highlights

Tree and Graph AlgorithmsTree search techniques and graph traversal strategies are essential for efficiently navigating complex data structures. These methods, including binary search and depth-first search, are crucial for technical interviews and practical applications.

Tree and Graph Algorithms

Data Analysis and ComplexityIn this episode, Joe Zack and Alan Underwood explore essential algorithms, focusing on Big O notation and data analysis tools. They discuss how these concepts are vital for understanding algorithm efficiency and managing large datasets effectively.

Data Analysis and Complexity

Sorting AlgorithmsThe episode explores the intricacies of sorting algorithms, focusing on Bubble Sort, Merge Sort, Quick Sort, and Heap Sort. Joe Zack and Alan Underwood discuss their efficiencies, applications, and the trade-offs involved in choosing the right algorithm for different scenarios.

Sorting Algorithms

Related Episodes