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

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.

== Synopsis

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

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

== Parameters

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


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