VOOZH about

URL: https://www.geeksforgeeks.org/cpp/boostalgorithmis_sorted-in-c-library/

⇱ boost::algorithm::is_sorted() in C++ library - GeeksforGeeks


  • Courses
  • Tutorials
  • Interview Prep

boost::algorithm::is_sorted() in C++ library

Last Updated : 11 Jul, 2025
The is_sorted() function in C++ boost library is found under the header 'boost/algorithm/cxx11/is_sorted.hpp' which tests if the given sequence is sorted or not according to some given criteria which is specified in the predicate. If no comparison predicate is specified, then std::less is used to see if the sequence is non-decreasing. Syntax:
bool is_sorted ( ForwardIterator first, ForwardIterator last, Pred p ) or bool is_sorted ( ForwardIterator first, ForwardIterator last ) or bool is_sorted ( const Range &r, Pred p ) or bool is_sorted ( const Range &r )
Parameters: The function accepts parameters as described below:
  • first: It specifies the input iterators to the initial positions in a sequence.
  • second: It specifies the input iterators to the final positions in a sequence.
  • p: It specifies the comparison predicate if specified.
  • r: It specifies the given range completely.
Return Value: The function returns true if the complete sequence is sorted according to the given criteria, else it returns false. Below is the implementation of the above approach: Program-1:
Output:
sorted
Program-2:
Comment
Article Tags: