C++ Library

Neil Gollapudi

Data Structures:

- Vector
- List (singly linked)
- Stack
- Queue
- Priority Queue (array based)
- Unordered Map (hash table with collision resolve using AVL tree)
- Map (AVL tree)

• All data structures are templated and used like C++ Standard Template Library data structures.

	vector<int> test1;

	priority_queue<std::string> test2(FUNCTOR)

	unordered_map<std::string, int> test3

Algorithms:

- Lower Bound (binary search)
- Upper Bound (binary search)
- Sort (combination of Quicksort and Insertion Sort)
- Swap (move semantics)