#include <iostream>
#include <time.h>
using namespace std;

#include "Fibonaccian_search_array.h"
#include "Fibonaccian_search_basic.h"
#include "Fibonaccian_search_pointer.h"
#include "Linear_search_pointer.h"
#include "Quick_sort_pointer.h"

int const N = 13579;

int main() {
	int *array = new int[N];

	for ( int i = 0; i < N; ++i ) {
		array[i] = lrand48();
	}

	Sorting_algorithms::Quick_sort::Pointer::sort( array, N );

	for ( int i = 0; i < N; ++i ) {
		cout << "Fibonaccian:        " <<
		Searching_algorithms::Fibonaccian_search::Basic::search( array[i], array, N ) <<
		Searching_algorithms::Fibonaccian_search::Basic::search( array[i] - 1, array, N ) <<
		Searching_algorithms::Fibonaccian_search::Basic::search( array[i] + 1, array, N ) <<
		Searching_algorithms::Fibonaccian_search::Array::search( array[i], array, N ) <<
		Searching_algorithms::Fibonaccian_search::Array::search( array[i] - 1, array, N ) <<
		Searching_algorithms::Fibonaccian_search::Array::search( array[i] + 1, array, N ) <<
		Searching_algorithms::Fibonaccian_search::Pointer::search( array[i], array, N ) <<
		Searching_algorithms::Fibonaccian_search::Pointer::search( array[i] - 1, array, N ) <<
		Searching_algorithms::Fibonaccian_search::Pointer::search( array[i] + 1, array, N ) << endl;

		cout << endl;
	}

	return 0;
}