Recursive algorithm pseudocode:

I am confused about recursive algorithms, specifically this one. Could I have an example of what the process of this algorithm is for an Array = 10,9,7,6, assuming start index begins at 1.

recFindMin (startIndex, A) if start Index =n return start Index x=rec Find Min (start Index +1,A) if A[x]