Sort list using STL sort function

by

The standard algorithm std::sort requires random access iterators, which std::list<>::iterators are not (list iterators are bidirectional iterators).

You should use the std::list<>::sort member function.

More Related Contents:

  1. c++ push reference node to stl list
  2. Sorting a vector of custom objects
  3. What’s the most efficient way to erase duplicates and sort a vector?
  4. C++ sorting and keeping track of indexes
  5. vector vs. list in STL
  6. How do I sort a std::vector by the values of a different std::vector?
  7. problem sorting using member function as comparator
  8. Is list::size() really O(n)?
  9. Sorting a vector in descending order
  10. how do you insert the value in a sorted vector?
  11. Does std::list::remove method call destructor of each removed element?
  12. c++ sort keeping track of indices [duplicate]
  13. How to use std::sort with a vector of structures and compare function?
  14. Sorting a std::vector by the string?
  15. array vs vector vs list
  16. Cleaning up an STL list/vector of pointers
  17. `std::list::sort()` – why the sudden switch to top-down strategy?
  18. Performance of qsort vs std::sort?
  19. How can I sort an STL map by value?
  20. Is std::pair ordering well-defined?
  21. Is there support in C++/STL for sorting objects by attribute?
  22. How to sort an STL vector?
  23. Which type of sorting is used in the std::sort()?
  24. list of polymorphic objects
  25. Why isn’t there an operator[] for a std::list?
  26. Is hash_map part of the STL?
  27. Why does storing references (not pointers) in containers in C++ not work?
  28. Can std::begin work with array parameters and if so, how?
  29. Is it more efficient to copy a vector by reserving and copying, or by creating and swapping? [duplicate]
  30. Obtain container type from (its) iterator type in C++ (STL)

Leave a Comment