Grabs the interval with largest load and cuts it into two equal loaded pieces. More...
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include <oned/rec_bisect.hpp>
#include <queue>
#include <algorithm>
#include <oned/greedy_bisect_impl.hpp>
Go to the source code of this file.
Grabs the interval with largest load and cuts it into two equal loaded pieces.
Classes | |
class | oned::GreedyBisection< T, Pr > |
Grabs the interval with largest load and cuts it into two equal loaded pieces. More... | |
Namespaces | |
namespace | oned |
This namespace provides one dimensional algorithms. |