"You'll know that iterating through a linked list is O(N), binary search is O(log(N)) and a hash table lookup is O(1)" Apples and Oranges? You'll select the re

"You'll know that iterating through a linked list is O(N), binary search is O(log(N)) and a hash table lookup is O(1)" Apples and Oranges? You'll select the relevant data structure depending on your application needs.