Play-with-Data-Structures/24_generic_programming_in_cpp/02_stl_containers_introduction.cpp at master · codescoop/Play-with-Data-Structures · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
/*
    TOPIC: STL Containers - Introduction

    Containers in STL:-
    - All the containers in STL are divided into 4 major catogries:
      1. Sequence Containers
      2. Container Adoptors
      3. Associative Containers
      4. Unordered Associative Containers


    Sequence Containers:
    - implement data structure which can be accessed in a sequential manner.
      - array
      - vector
      - list (Double Linked List)
      - deque
      - forward list (Single Linked List)

    Container Adoptors:
    - provide a different interface for sequential containers.
      - stack
      - queue
      - priority queue

    Associative Containers:
    - implement sorted data structure that can be quickly searched (O(logn) Complexity).
      - set
      - multiset
      - map
      - multimap
      NOTE: All the above data structures are some kind of binary search tree's like Red-Black Tree,...

    Unordered Associative Containers:
    - implement unordered data structure that can be quickly searched.
      - unordered set
      - unordered multiset
      - unordered map
      - unordered multimap

*/