Question

What would be the asymptotic time complexity to find an element in the linked list? *



option A. O(1)

opyion B......O(n)

option C......O(n2)

option D........O(n4)

option E......Other


​

Answer 1

Answer:

Definition of linked list:

A linked list is a non-primitive data structure in which each element is dynamically allocated and elements point to one another to establish a linear relationship. Nodes are the elements of a linked list, and each node contains two things: data and a pointer to the next node.

Explanation: We must traverse the complete linked list if the needed element is in the last position. The element will be searched in O (n) time.

Option B is the right response because the answer to the given question is O(n).

Answer 2

Answer:

The correct answer is Option A i.e. O(1).

Explanation:

i) Asymptotic Time Complexity is defined as the limiting behavior of the execution time of an algorithm when the size of the problem goes to infinity.

ii) Asymptotic Time Complexity is usually denoted by O(n).

iii) In a linked list, the time taken to find an element is O(1).

iv) Hence, the correct answer is O(1).

#SPJ3