Finding First and Last occurrence in sorted list

Finding first and last occurrence of given number in sorted list is a very easy problem and can easily solved by leaner search with worse case Time complexity O(n) .
But We can Achieve faster search of first and last occurrence of a number by exploiting sorted feature of list.
We can  search  occurrence of any number in sorted list in O(log(n)) Time Complexity by using Binary search Algorithm.

We can Modify binary search to find first and last occurrence of number and its complexity will be O(lon(n)) .

Finding First occurrence :

1. apply binary search to search number if found save that index as ind
2. then search again in left sub list i.e 0 to Ind-1
3. repeat until no occurrence of n found in left sub-list
4. return ind 

C++ Source Code :

1. //Find first occurence in sorted array in O(log(n))
2. #include<iostream>
3. #include<vector>
4. using namespace std;
6. int searchFirstInd(vector<int> &arr,int key,int low,int high){
7.         //using iterative modified binary search to find fist occurrence
8.         int mid,ind=-1;
9.         while(low<=high){
10.                 mid=(low+high)/2;
11.                 if(arr[mid]==key){
12.                         ind=mid;
13.                         high=mid-1; //finding occurrence of first key
14.                 }
15.                 else if(arr[mid]<key)
16.                         low=mid+1;
17.                 else
18.                         high=mid-1;
19.         }
20.         return ind;
21.         //return -1 if not found
22. }
23. int main(){
24.         vector<int> arr;
25.         int n;
26.         cout<<"Enter No of element in sorted array :";
27.         cin>>n;
28.         cout<<"Enter n Element: "<<endl;
29.         int key;
30.         for(int i=0;i<n;i++){
31.                 cin>>key;
32.                 arr.push_back(key);
33.         }
34.         cout<<"Enter key to Search its first occurrence :";
35.         cin>>key;
36.        
37.         cout<<"Index of first occurrence of "<<key<<" is "<<searchFirstInd(arr,key,0,n-1);
38. }

First Occurence

Finding Last occurrence :

1. apply binary search to search number if found save that index as ind
2. then search again in left sub list i.e Ind-1 to end of list
3. repeat until no occurrence of n found in left sub-list
4. return ind 

C++ Source Code:

1. //Find Last occurrence in sorted array in O(log(n))
2. #include<iostream>
3. #include<vector>
4. using namespace std;
6. int searchFirstInd(vector<int> &arr,int key,int low,int high){
7.         //using iterative modified binary search to find Last occurrence
8.         int mid,ind=-1;
9.         while(low<=high){
10.                 mid=(low+high)/2;
11.                 if(arr[mid]==key){
12.                         ind=mid;
13.                         low=mid+1  //finding index of last occurrence of key
14.                 }
15.                 else if(arr[mid]<key)
16.                         low=mid+1;
17.                 else
18.                         high=mid-1;
19.         }
20.         return ind;
21.         //return -1 if not found
22. }
23. int main(){
24.         vector<int> arr;
25.         int n;
26.         cout<<"Enter No of element in sorted array :";
27.         cin>>n;
28.         cout<<"Enter n Element: "<<endl;
29.         int key;
30.         for(int i=0;i<n;i++){
31.                 cin>>key;
32.                 arr.push_back(key);
33.         }
34.         cout<<"Enter key to Search its Last occurrence :";
35.         cin>>key;
36.        
37.         cout<<"Index of Last occurrence of "<<key<<" is "<<searchFirstInd(arr,key,0,n-1);
38. }