Hello,
while i was reading Operating System Concepts by Abraham Silberchatz i was confused because in file systems chapter in directory implementation it was written that the simplest method of implementing directory is to use a linear list, however its real disadvantage is that finding a file requires a linear search. Then it's written that a binary search can also be done on list if it's kept in sorted order.
I am confused as to can we do a binary search on linked list??is it possible? i mean in array we can directly access the element at specified location but in linked list there is no such provision.
Originally Posted by master5001
