2 2 votes The time required to search an element in a linked list of length n is $O(\log_2 n)$ $O(n)$ $O(1)$ $O(n^2)$ Data Structures isro2008 data-structures linked-list time-complexity + – go_editor 19.4k views answer comment Share Follow Print See 1 comment 1 1 comment reply Pranav Kant Gaur commented Jun 13, 2016 reply Follow flag Assuming we are talking about average case, clearly, option (B). 0 0 replyShare Please log in or register to add a comment.
Best answer 12 12 votes The time required to search an element in a linked list of length n is O(n). In the worst case, the element to be searched has to be compared with all elements of linked list. Option B is correct. ManojK answered Jun 13, 2016 • selected Jun 25, 2016 by Arjun ManojK comment Share Follow 0 reply Please log in or register to add a comment.
