Byte Sized Episode 3: The First Ever Sorting Algorithm

Today's episode of Byte Sized is about the B-tree. In computer science, a B-tree is a self-balancing tree data structure that maintains sorted data and allows searches, sequential access, insertions, and deletions in logarithmic time.

You can find more info about b-trees here...

Follow Byte Sized for an adventure through computer history, a few minutes at a time. More great episodes to come.