In the following code, what is the algorithm's complexity? minIndex = 0 CurrentIndex = 1 While currentIndex

Question

In the following code, what is the algorithm's complexity? minIndex = 0
CurrentIndex = 1
While currentIndex < len(lyst) :
If lyst[currentIndex] < lyst[minIndex]:
MinIndex = currentIndex
CurrentIndex += 1
Return minIndex

Quizplus · Accepted Answer

The algorithm only iterates through the list once, making it a linear time complexity, O(n). None of the other options make sense as they include unnecessary and undefined operations.

In the Following Code, What Is the Algorithm's Complexity? MinIndex