Frage im Vorstellungsgespräch bei Riverbed Technology
running time for binary search using linked list
Antwort im Vorstellungsgespräch
Anonym
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.