| [ Web Proxy ] |
| Viewing: https://raw.githubusercontent.com/feiguohai09/interview/master/Algorithm/FibonacciSearch.cpp | [Back] [Original] |
//
#include "stdafx.h"
#include
#include
using namespace std;
const int max_size=20;//
/**/
void Fibonacci(int * F)
{
F[0]=0;
F[1]=1;
for(int i=2;iF[k]-1)//n
++k;
int * temp;//aF[k]-1
temp=new int [F[k]-1];
memcpy(temp,a,n*sizeof(int));
for(int i=n;i
| Web Proxy Viewer | New URL | Original Page |