Question: The array A[0..(n-1)] contains n elements. Write an algorithm that returns the index and the value of the smallest element in the array A, where
The array A[0..(n-1)] contains n elements. Write an algorithm that returns the index and the value of the smallest element in the array A, where the index refers to the first occurrence of the minimum in the array.
Require simple algorithm, not actual code. Thanks for the help!
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
