Data Structures and Algorithms

Design an algorithm to return the index in A at which v is found. If v is
Not found in A, return -1. (A simple and straight forward solution is to scan the array elements one-by-one, until v is found or all elements have been examined.)The array index starts with 0 and ends at n-1. Specify the algorithm as a pseudo-code.