Home Modern Forums ISRO

The time required to search an element in a linked list of length n is
(A) O (log n)
(B) O (n)
(C) O (1)
(D) O(n2)

Reply To:

The time required to search an element in a linked list of length n is
(A) O (log n)
(B) O (n)
(C) O (1)
(D) O(n2)

Up
0
Down
::

nan