# std::experimental::ranges::Sortable

> C++ Atlas: `cppatlas.com/w/cpp/experimental/ranges/iterator/Sortable` | Source: https://en.cppreference.com/w/cpp/experimental/ranges/iterator/Sortable | Domain: Technical specifications

The Sortable concept specifies the common requirements of algorithms that permute sequences into ordered sequences (for example, ranges::sort).

## Official Specification Summary (cppreference)

```cpp
template< class I, class R = ranges::less<>, class P = ranges::identity >
concept bool Sortable =
    Permutable<I> &&
    IndirectStrictWeakOrder<R, ranges::projected<I, P>>; // (ranges TS)
```

The `Sortable` concept specifies the common requirements of algorithms that permute sequences into ordered sequences (for example, `ranges::sort`).

---
Attribution: content from https://en.cppreference.com/w/cpp/experimental/ranges/iterator/Sortable (cppreference.com), licensed under CC-BY-SA 3.0 and GFDL. Modified: converted to markdown, study notes added. Offline snapshot of 9 February 2025.