Name: Episode 2 - Binary Search by Programming
Duration: 19 min 19 s
Description: Today we'll discuss the binary search algorithm. We'll go through several examples when the algorithm makes sense and discuss in detail how it works. By the end of the episode, you'll know when to apply a binary search and know why it's more efficient than a linear search.

Today we'll discuss the binary search algorithm. We'll go through several examples when the algorithm makes sense and discuss in detail how it works. By the end of the episode, you'll know when to apply a binary search and know why it's more efficient than a linear search.

Programming Podcast

Episode 2 - Binary Search

Instead of digging into algorithms and data structures, today, you'll learn about epidemic modeling. In 9 minutes in this episode, you'll get a mathematical intuition on the spread of COVID-19 and the essential variables we can control, which can help us fight the virus.

Episode 12 - COVID-19. Epidemic modeling with SIR.

Today we're going to discuss the binary heap data structure. In this episode, you'll learn where to use heaps in practice, how they can come handy to you during a coding interview, and how to implement them!

Along the way, we'll cover heap sort, priority queues, load balancing, and more!

Episode 13 - Binary Heaps

In today's episode, you'll learn the four principles of object-oriented programming. We'll discuss abstraction, inheritance, encapsulation, and polymorphism. By the end of the show, you'll understand each one of them; you'll know how they relate to each other, and how to use them in practice.

Episode 14 - The Four Principles of OOP

In this episode of the programming podcast, we'll discuss static analysis and code transformation. In particular, we'll look at the difference between compilers, linters, and formatters.

By the end of the episode, you'll understand what tool you should use to improve your development experience and team processes.

Episode 15 - Compilers, Linters, and Formatters

Today we'll learn about memoization! Memoization is a practice that helps us improve the performance of our apps using caching.

In the episode, we'll also discuss pure functions, caching strategies, and much more!

Episode 16 - Memoization

Today we'll talk about using dependency injection across paradigms! You'll understand what this pattern is all about and how to use it.

During the episode, we'll touch on topics such as inversion of control, high-order functions, and testability.

Episode 17 - Dependency Injection

In this episode, we'll look at what data structures and algorithms JavaScript bundlers use.

We'll talk about ECMAScript modules, strongly connected components, depth-first search, and more! Enjoy!

Episode 18 - How JavaScript Bundlers Work

In this episode, we'll look at the very basics of type systems and their enforcement.

We'll discuss strongly and weakly typed languages. After that, we'll dig into different enforcement strategies - runtime with dynamic typing and compile-time with static typing.

Episode 19 - Type Systems and Type Checking

Today we'll look into static and dynamic systems. We'll discuss what does it mean for a programming language or a framework to be static or dynamic.

In the second part of the podcast, we'll focus on some of the properties of static systems and how they can help in better compile-time optimizations, development experience, and more!

Episode 20 - Static and Dynamic Systems

Today in less than 20 minutes, we'll explore what maps are and how they work under the hood. We'll talk about the differences between treemaps, hash maps, and hash tables.

We'll dig pretty in-depth...By the end of the episode, you'll understand how to implement hash tables using an array, hash function, and a linked list!

Episode 21 - Maps, Hash Maps, Tree Maps, and Hash Tables

Programming is a weekly podcast that aims to make us better software engineers! With each episode, you'll learn about a computer science concept in a brief and accessible way.

Episode 2 - Binary Search

Programming

Related tracks