Answer:
The solution code is written in Python
- def findSmallest(vec, start):
-
- index = start
- smallest = vec[start]
-
- for i in range(start + 1, len(vec)):
- if(smallest > vec[i]):
- smallest = vec[i]
- index = i
-
- return index
Explanation:
Firstly we can define a function findSmallest() that takes two input parameters, a vector, <em>vec</em>, and a starting position, <em>start </em> (Line 1).
Next, create two variables, <em>index</em> and <em>smallest</em>, to hold the current index and current value where the smallest number is found in the vector. Let's initialize them with <em>start</em> position and the value held in the<em> start </em>position (Line 3-4).
Next, create a for-loop to traverse through the next value of the vector after start position and compare it with current <em>smallest </em>number. If current <em>smallest</em> is bigger than any next value in the vector, the <em>smallest </em>variable will be updated with the new found lower value in the vector and the index where the lower value is found will be assigned to variable<em> index</em>.
At the end return index as output.