Pregunta de entrevista de Riverbed Technology
running time for binary search using linked list
Respuesta de la entrevista
Anónimo
30 oct 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
Anónimo
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.