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 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...
Published 07/01/20
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...
Published 06/23/20
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.
Published 06/16/20