Start / Data Skeptic / Mini k d trees

[MINI] k-d trees

14 min • 5 februari 2016

This episode reviews the concept of k-d trees: an efficient data structure for holding multidimensional objects. Kyle gives Linhda a dictionary and asks her to look up words as a way of introducing the concept of binary search. We actually spend most of the episode talking about binary search before getting into k-d trees, but this is a necessary prerequisite.

Senaste avsnitt

Network of Past Guests Collaborations

21 juli | 34 min

The Network Diversion Problem

6 juli | 46 min

Complex Dynamic in Networks

28 juni | 56 min

Github Network Analysis

22 juni | 37 min

Networks and Complexity

14 juni | 18 min

Podcastbild

00:00 -00:00

Podcastbild

00:00 -00:00