// Copyright (C) 2006 Didier Baertschiger// e-mail contact: dibaer@gmail.com// The MPTL library is free software; you can redistribute it and/or// modify it under the terms of the GNU Lesser General Public// License as published by the Free Software Foundation; either// version 2.1 of the License, or (at your option) any later version.// This library is distributed in the hope that it will be useful,// but WITHOUT ANY WARRANTY; without even the implied warranty of// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU// Lesser General Public License for more details.// You should have received a copy of the GNU Lesser General Public// License along with this library; if not, write to the Free Software// Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA#include <iostream>#include <vector>#include <list>#include <deque>#include <algorithm>#include <numeric>#include <functional>#include "mptl.h"#include "mptl_algo.h"#include "mptl_qsort.h"#include "utils.h"using namespace std;int main (int argc, char * const argv[]) {    mptl::setNumThreads(2);    vector<int> v1(5500);        mptl::setMaxInterval(100);    mptl::sort(v1.begin(), v1.end());    }