=====partition=====
Syntax:

<code>
    #include <algorithm>
    bidirectional_iterator partition( bidirectional_iterator start, bidirectional_iterator end, Predicate p );
</code>

The partition algorithm re-orders the elements in ''[start,end)'' such that the
elements for which the predicate ''p'' returns true come before the elements for
which ''p'' returns false.

In other words, partition uses ''p'' to divide the elements into two groups.
The return value of partition is an iterator to the first element for which ''p''
returns false.

partition runs in [[/complexity|linear time]].

Related Topics: [[stable_partition]]