[#absl-c_partial_sort-0e]
= xref:absl.adoc[absl]::c_partial_sort
:relfileprefix: ../
:mrdocs:

`c_partial_sort` overloads

== Synopses

Declared in `<absl/algorithm/container.h>`

Container‐based version of the <algorithm> `std::partial_sort()` function to rearrange elements within a container such that elements before `middle` are sorted in ascending order.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<typename RandomAccessContainer>
constexpr
void
xref:absl/c_partial_sort-05.adoc[c_partial_sort](
    RandomAccessContainer& sequence,
    /* implementation-defined */ middle);
----

[.small]#xref:absl/c_partial_sort-05.adoc[_» more..._]#

Overload of `c_partial_sort()` for performing a `comp` comparison other than the default `operator<`.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<
    typename RandomAccessContainer,
    typename LessThan>
constexpr
void
xref:absl/c_partial_sort-0c.adoc[c_partial_sort](
    RandomAccessContainer& sequence,
    /* implementation-defined */ middle,
    LessThan&& comp);
----

[.small]#xref:absl/c_partial_sort-0c.adoc[_» more..._]#

== Parameters

[cols="1,4"]
|===
| Name| Description
| *sequence*
| The container to partially sort.
| *middle*
| An iterator to the end of the range to be sorted.
| *comp*
| The comparison used to order the elements.
|===


[.small]#Created with https://www.mrdocs.com[MrDocs]#