GATE 2002: In the worst case, the number of… Algorithms 0 Ravi Garg 3 Rep. December 8, 2015 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 January 14, 2016 1 answer ActiveVotedNewestOldest 0 Sonali Kapoor (anonymous) January 8, 2016 Its d) Sonali Kapoor answered January 8, 2016 Toggle fullscreen Write Add image to editor add image from link NamePost answer Follow 1 Question stats ActiveJanuary 14, 2016Views296 timesAnswers1 answerFollowers1 follower Question and answer is powered by AnsPress