Sollicitatievraag bij Riverbed Technology
running time for binary search using linked list
Antwoord op sollicitatievraag
Anoniem
30 okt 2012
Can't do it in O(n) or O(log n) as you need to seek to the end at least once. You will need a skip list.
running time for binary search using linked list
Anoniem
Can't do it in O(n) or O(log n) as you need to seek to the end at least once. You will need a skip list.