-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathfal.cpp
50 lines (46 loc) · 909 Bytes
/
fal.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
#include<iostream>
using namespace std;
int firstocc(int arr[],int n,int key){
int s = 0,e = n-1;
int mid = s +(e-s)/2;
int ans = -1;
while (s<=e) {
if(arr[mid]==key){
ans = mid;
e = mid-1;
}
else if (key>arr[mid]) {
s = mid+1;
}
else if(key<arr[mid]){
e = mid-1;
}
mid = s + (e-s)/2;
}
return ans;
}
int lastocc(int arr[],int n,int key){
int s = 0,e = n-1;
int mid = s +(e-s)/2;
int ans = -1;
while (s<=e) {
if(arr[mid]==key){
ans = mid;
s = mid+1;
}
else if (key>arr[mid]) {
s = mid+1;
}
else if(key<arr[mid]){
e = mid-1;
}
mid = s + (e-s)/2;
}
return ans;
}
int main(){
int arr[11]={1,2,3,3,3,3,3,4,5,6,7};
cout<<"First Occurance is at index "<<firstocc(arr,11,3)<<endl;
cout<<"Last Occurance is at index "<<lastocc(arr,11,3)<<endl;
return 0;
}