bfraboni

#include <iostream>
#include <vector>
#include <random>
#include <algorithm>

// Non stored iteration order over a 2D array of dimension NxM
// (walk through every cell only once)

// 1. deterministic orders 
// row per row

bfraboni

#include <chrono>
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <random>
#include <cassert>

// Comparison between exhaustive search, binary search, and linear fit / interpolation search for sorted arrays.

bfraboni

#include <cstdio>
#include <chrono>
#include <omp.h>

void viewer( int& a, bool& stop )
{
    printf("thread %d start viewer\n", omp_get_thread_num());
    auto start = std::chrono::high_resolution_clock::now();
    while( !stop )
    {

bfraboni

// Copyright (C) 2017 Basile Fraboni
// Copyright (C) 2014 Ivan Kutskir
// All Rights Reserved
// You may use, distribute and modify this code under the
// terms of the MIT license. For further details please refer 
// to : https://mit-license.org/
//

//!
//! \file blur.cpp