LB are lower array bound and upper bound are UB. Consider following algorithm…
2022
LB are lower array bound and upper bound are UB. Consider following algorithm – Repeat for K = LB to UB apply PROCESS to LA[K] Exit The algorithm ______ the array LA.
- A.
sorts
- B.
searches
- C.
traverses
- D.
merges
Attempted by 164 students.
Show answer & explanation
Correct answer: C
The algorithm iterates through the array LA from the lower bound (LB) to the upper bound (UB), applying a process to each element sequentially. This operation visits every element in order without modification or searching, which is defined as traversing the array. Therefore, the correct term to complete the statement is "traverses".