Question

Consider a procedure LIST-SEARCH (L, K) finds the first element with key K in list L by simple linear search, returning a pointer to its element. Arrange the following according to correct order of execution.
• [A.] x = L.head
• [B.] while x $\neq$ NIL and x.key $\neq$ K
• [C.] return x
• [D.] x = x.next
Choose the correct answer from the options given below:

• A. A, B, D, C
• B. B, C, D, A
• C. A, D, B, C
• D. A, B, C, D

Hint:

Traversal always follows: Initialize → Check → Move → Return.

Answer 1

The Correct Option is A