What is STL?
- STL refers to the Standard Template Library of C++.
- STL is a generic library that provides collections classes for managing data and algorithms that operate on them.
- STL avoids the need to implement our own data structures and algorithms like linked lists, binary trees etc and they are directly available for use.
- Key components in STL are Containers, Iterators and Algorithms.
- Containers manage collection of objects. Examples of containers include Sets, Multisets, Maps, Multimaps, Vectors, Lists etc.
- Iterators offer a common and simple interface to parse through collection of objects. Iterators connect containers to algorithms.
- Algorithms process elements of collections. Examples of algorithms include search, sort etc. Algorithms use services of iterators.