For which of the data structure link lists are not suitable?
For which of the data structure link lists are not suitable?
The correct option is B Binary search
Binary search of the
data structure link lists are not suitable.
Binary search based on divide and
conquer algorithm, determination of middle element is important. Binary search
is usually fast and efficient for arrays because accessing the middle index
between two given indices is easy and fast. But memory allocation for singly
linked list is dynamic and non-contiguous, which makes finding the middle
element difficult. One approach could be of using skip list; one could be
traversing the linked list using one pointer.
A linked listis a linear collection
of data elements, whose order is not given by their physical placement in
memory. Instead, each element points to the next. It is a data structure consisting of a collection of nodes which together represent a sequence.
Binary search of the data structure link lists are not suitable.
Binary search based on divide and conquer algorithm, determination of middle element is important. Binary search is usually fast and efficient for arrays because accessing the middle index between two given indices is easy and fast. But memory allocation for singly linked list is dynamic and non-contiguous, which makes finding the middle element difficult. One approach could be of using skip list; one could be traversing the linked list using one pointer.
A linked listis a linear collection of data elements, whose order is not given by their physical placement in memory. Instead, each element points to the next. It is a data structure consisting of a collection of nodes which together represent a sequence.
