-
Notifications
You must be signed in to change notification settings - Fork 70
/
Fibonacci_Series.cpp
66 lines (60 loc) · 1.21 KB
/
Fibonacci_Series.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
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
#include <bits/stdc++.h>
using namespace std;
int min(int x, int y) { return (x <= y) ? x : y; }
int fibonacciSearch(int arr[], int x, int n)
{
int a = 0;
int b = 1;
int net = a + b;
while (net < n)
{
a = b;
b = net;
net = a + b;
}
int negl = -1;
while (net > 1)
{
int i = min(negl + a, n - 1);
if (arr[i] < x)
{
net = b;
b = a;
a = net - b;
negl = i;
}
else if (arr[i] > x)
{
net = a;
b = b - a;
a = net - b;
}
else
return i;
}
if (b && arr[negl + 1] == x)
return negl + 1;
return -1;
}
int main()
{
int num;
cout << "Enter number of elements of array: ";
cin >> num;
int arr[num];
cout << "Enter array elements: ";
for (int i = 0; i < num; i++)
{
cin >> arr[i];
}
int n = sizeof(arr) / sizeof(arr[0]);
int x;
cout << "Enter number of elements to search: ";
cin >> x;
int ind = fibonacciSearch(arr, x, n);
if (ind >= 0)
cout << "Found at index: " << ind;
else
cout << x << " => Not Found";
return 0;
}