GATE 2002: In the worst case, the number of…

0

GATE 2002:
In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is
(a) log n
(b)n^2
(c) log—1
(d) n

Ravi Garg edited question
    0
    Sonali Kapoor (anonymous)

    Its d)

    Sonali Kapoor answered
      Add image to editor add image from link

      Question stats

      • Active
      • Views271 times
      • Answers1 answer
      • Followers1 follower
      Question and answer is powered by AnsPress