Domanda di colloquio di Riverbed Technology
running time for binary search using linked list
Risposta di colloquio
Anonimo
30 ott 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
Anonimo
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.