DEV Community

Base.cs Podcast

Latest episodes

S9:E8 - "In the end, the code you take is equal to the code you make"

S9:E8 - "In the end, the code you take is equal to the code you make"

Base.cs Podcast,
S9:E7 - "This way to translate is le-JIT"

S9:E7 - "This way to translate is le-JIT"

Base.cs Podcast,
S9:E6 - "Two translators, both alike in dignity"

S9:E6 - "Two translators, both alike in dignity"

Base.cs Podcast,
S9:E5 - "Paring down our parse trees with AST"

S9:E5 - "Paring down our parse trees with AST"

Base.cs Podcast,
S9:E4 - "Confused about compilers?"

S9:E4 - "Confused about compilers?"

Base.cs Podcast,
S9:E3 - "Parsing out parse trees"

S9:E3 - "Parsing out parse trees"

Base.cs Podcast,
S9:E2 - "Speeding up our traveling salesperson"

S9:E2 - "Speeding up our traveling salesperson"

Base.cs Podcast,
S9:E1 - "Take a journey with the Traveling Salesman"

S9:E1 - "Take a journey with the Traveling Salesman"

Base.cs Podcast,
S8:E8 - "Memoizing all the things in dynamic programming"

S8:E8 - "Memoizing all the things in dynamic programming"

Base.cs Podcast,
S8:E7 - "Dynamic Programming is pretty dynamite "

S8:E7 - "Dynamic Programming is pretty dynamite "

Base.cs Podcast,
S8:E6 - "Getting deeper into Dijkastra"

S8:E6 - "Getting deeper into Dijkastra"

Base.cs Podcast,
S8:E5 - "Dijkstra's algorithm is a weighty topic"

S8:E5 - "Dijkstra's algorithm is a weighty topic"

Base.cs Podcast,
S8:E4 - "DAG, Daniel! Back at it again..."

S8:E4 - "DAG, Daniel! Back at it again..."

Base.cs Podcast,
S8:E3 - "Living on the edge!"

S8:E3 - "Living on the edge!"

Base.cs Podcast,
S8:E2 - "Jump around the indexes with DFS!"

S8:E2 - "Jump around the indexes with DFS!"

Base.cs Podcast,
S8:E1 - "Getting deep with depth-first search"

S8:E1 - "Getting deep with depth-first search"

Base.cs Podcast,
S7:E8 - "Delivering muffins with BFS"

S7:E8 - "Delivering muffins with BFS"

Base.cs Podcast,
S7:E7 - "Plotting to represent a graph? We got you."

S7:E7 - "Plotting to represent a graph? We got you."

Base.cs Podcast,
S7:E6 - "It's laughable how easy it is to get graphical"

S7:E6 - "It's laughable how easy it is to get graphical"

Base.cs Podcast,
S7:E5 - "To b-tree or not to b-tree"

S7:E5 - "To b-tree or not to b-tree"

Base.cs Podcast,
S7:E4 - "A 2-3 tree for you and me"

S7:E4 - "A 2-3 tree for you and me"

Base.cs Podcast,
S7:E3 - "Color me logarithmic!"

S7:E3 - "Color me logarithmic!"

Base.cs Podcast,
S7:E2 - "Stay gold, AVL tree, stay gold."

S7:E2 - "Stay gold, AVL tree, stay gold."

Base.cs Podcast,
S7:E1 - "The AVL balancing act"

S7:E1 - "The AVL balancing act"

Base.cs Podcast,
S6:E8 - "Meet our good friend PATRICIA"

S6:E8 - "Meet our good friend PATRICIA"

Base.cs Podcast,
S6:E7 - "The cannibalistic efficiency of radix trees"

S6:E7 - "The cannibalistic efficiency of radix trees"

Base.cs Podcast,
S6:E6 - "Dear tries, you (auto)complete me"

S6:E6 - "Dear tries, you (auto)complete me"

Base.cs Podcast,
S6:E5 - "Tries: the golden retriever of data structures"

S6:E5 - "Tries: the golden retriever of data structures"

Base.cs Podcast,
S6:E4 - "Radix sort: the patient zero of sorting algorithms "

S6:E4 - "Radix sort: the patient zero of sorting algorithms "

Base.cs Podcast,
S6:E3 - "You can count on counting sort"

S6:E3 - "You can count on counting sort"

Base.cs Podcast,

Browse