Data Structures

Theory - Ordered Data Structures

Lesson

You now know about O(n)O(n) data structures like Arrays LinkedLists, and O(1)O(1) data structures like Sets and HashMaps.

Hopefully you have a sense of why Arrays and LinkedLists are "slower" in general - they're storing and using more information! There's a 1st element, a 2nd element, etc, unlike Sets and HashMaps, where elements have no order. Another way of looking at this is that O(n)O(n) data structures have more "entropy" than O(1)O(1) ones.

In the Binary Search section, you'll learn about O(logn)O(\log n) data structures - the final type of data structure you need to know (and that really exists!).

Mark as Completed:
Submits:
NAME
Test your code to get an output here!
NAME(
)
Test your code to get an output here!