C++ STL Tutorial

  • Last Updated : 19 Nov, 2021


The Standard Template Library (STL) is a set of C++ template classes to provide common programming data structures and functions such as vector, lists, stacks, etc.

Standard Template Library (STL)

Algorithms

  1. Introduction to STL
  2. Sorting
  3. Searching

Containers:

  1. Pair
  2. Vector
  3. List
  4. Dequeue
  5. Queue
  6. Priority Queue
  7. Stack
  8. Set
  9. Multiset
  10. Map
  11. Multimap
  12. Heap using STL C++

More:

  1. C++ Magicians – STL Algorithms
  2. sort() in C++ STL
  3. Type Inference in C++ (auto and decltype)
  4. transform() in C++ STL
  5. Variadic function templates in C++
  6. Template Specialization
  7. Merge operations using STL in C++ (merge, includes, set_union, set_intersection, set_difference, ..)
  8. std::partition in C++ STL
  9. numeric header in C++ STL | Set 1 (accumulate() and partial_sum())
  10. numeric header in C++ STL | Set 2 (adjacent_difference(), inner_product() and iota())
  11. Common Subtleties in Vector STLs
  12. unordered_map in STL and its applications
  13. unorderd_set in STL and its applications
  14. Useful Array algorithms in C++ STL

To master C++ Standard Template Library (STL) in the most efficient and effective way, do check out this C++ STL Online Course by GeeksforGeeks. The course covers the basics of C++ and in-depth explanations to all C++ STL containers, iterators, etc along with video explanations of a few problems. Also, you’ll learn to use STL inbuilt classes and functions in order to implement some of the complex data structures and perform operations on them conveniently.

Ask a Question on C++ STL?

My Personal Notes arrow_drop_up


Writing code in comment? Please use ide.geeksforgeeks.org, generate link and share the link here.