in the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is
Answers
Answered by
3
Answer:It contains well written, well thought and well explained computer science and programming articles, ... In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element
Step-by-step explanation:
Answered by
1
n
is the right answer it will be correct
Similar questions