Fibonacci C++ program search

#include (iostream)
using namespace std;
#include (conio.h)
#include (stdlib.h)

int main()
{
int i,j,F0,F1,Fibo,n,m,N,Flag;
int fk,fk1,fk2,fk3,s,p,q,t;
int a[15]={ 0,8,10,12,14,17,20,22,25,28,32,35,39,40,45 };

int Fibo1[8];



n=15;

F0=1; F1=1; Fibo=1;
j=1;
while (Fibo <= n+1) { Fibo1[j] = Fibo; Fibo=F0+F1; F0=F1; F1=Fibo; j++; } s=j-1; fk=Fibo1[s]; fk1=Fibo1[s-1]; i=fk1; fk2=Fibo1[s-2]; p=fk2; fk3=Fibo1[s-3]; q=fk3; m=(n+1)-fk; system ("cls"); for(int b=0;b<15;b++) { cout<<"Array : "<<<<"\nInputkan Sebuah Nilai Dari Data Diatas : "; cin>>N;



if(N>a[i]) i=i+m;

Flag=0;
while(i!=0 && Flag==0)
{
if(N==a[i]) Flag=1;
else
if(N<<"\nData Ditemukan"<<<"====> Data terletak Diurutan : "<<
}

else

cout<<"Data Tidak Ditemukan"<<
}

Fibonacci C++ program search

#include
using namespace std;
#include
#include

int main()
{
int i,j,F0,F1,Fibo,n,m,N,Flag;
int fk,fk1,fk2,fk3,s,p,q,t;
int a[15]={ 0,8,10,12,14,17,20,22,25,28,32,35,39,40,45 };

int Fibo1[8];



n=15;

F0=1; F1=1; Fibo=1;
j=1;
while (Fibo <= n+1) { Fibo1[j] = Fibo; Fibo=F0+F1; F0=F1; F1=Fibo; j++; } s=j-1; fk=Fibo1[s]; fk1=Fibo1[s-1]; i=fk1; fk2=Fibo1[s-2]; p=fk2; fk3=Fibo1[s-3]; q=fk3; m=(n+1)-fk; system ("cls"); for(int b=0;b<15;b++) { cout<<"Array : "<<<<"\nInputkan Sebuah Nilai Dari Data Diatas : "; cin>>N;



if(N>a[i]) i=i+m;

Flag=0;
while(i!=0 && Flag==0)
{
if(N==a[i]) Flag=1;
else
if(N<<"\nData Ditemukan"<<<"====> Data terletak Diurutan : "<<
}

else

cout<<"Data Tidak Ditemukan"<
}