/STL

STL Algorithms and Containers

Primary LanguageC++

Standard Template Library (STL)

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

STL Algorithms

  1. Sort
  2. Binary Search
  3. Lower Bound and Upper Bound
  4. Maximum and Minimum
  5. Rotate
  6. Swap
  7. Reverse

STL Containers

  1. Sequence Containers - Data Structures which can be accessed in a sequential manner

    • Vector
    • List
    • Deque
    • Array

  2. Container Adaptors - Provides a different interface for sequential containers

    • Stack
    • Queue
    • Priority Queue

  3. Associative Containers - Data Structures that can be quickly searched (O(log n) complexity)

    • Set
    • Map

  4. Unordered Associative Containers - Unordered Data Structures that can be quickly searched

    • Unordered Set
    • Unordered Map

How to use this repository

  1. Clone this repository
  2. Select the topic you want to learn, and open the .cpp file for that topic
  3. Run the code

For better understanding, keep the code and output side-by-side