1. Searching sequentially a sorted array without duplicate items.

   1. Design algorithm int SearchSorted_Asc(int L[], int n, int k) that finds and returns the index of k in L sorted in ascending order. If k is not found, -1 is returned. For example, given array int C[10] = {20, 30, 40, 50, 60, 70 , 80, 90, 100, 110}; sorted in ascending order. The call SearchSorted_ Asc (C, 10, 70); should return 5 (index of 70 in the above array C).

The call: SearchSorted_ Asc (C, 10, 35); should return -1(not found).

2. Design algorithm int SearchSorted_Des(int L[], int n, int k) that finds and returns the index of k in L sorted in descending order. If k is not found, -1 is returned. For example, given array int D[12] = {120, 110, 100, 90, 80, 70 , 60, 50, 40, 30, 20, 10}; sorted in descending order. The call SearchSorted_ Dec(D, 10, 90); should return 3 (index of 90 in the above array D).

The call: SearchSorted_ Dec(D, 10, 115); should return -1(not found).