This project is under development, below is the list of implement features,upcoming features adn much more.
- Array
- Iterators
- Functions (size,begin,end,swap)
- Vector
- Iterators
- Functions (size,popback,pushback,emplaceback,swap)
- LinkedList
- ForwardList(Singly LinkedList)
- CForwardList(Singly Circular LinkedList)
- List (Doubly LinkedList)
- CList (Doubly Circular LinkedList)
- Stack
- Stack Using Array
- Stack Using Linked List
- Queue
- Queue Using Array
- Queue Using LinkedList
- Deque
- Deque
- Trees
- Binary Search Tree
- AVL
- RBT
- Sorting
- QuickSort (qsort/sort/stablesort)
- MergeSort (msort)
- RadixSort (rsort)
- HeapSort (hsort)
- CycleSort (csort)
- BubbleSort (bsort)
- InsertionSort (isort)
- SelectionSort (ssort)
- Searching
- Linear Search
- Binary Search
- Strings
- KMP
- Rabin Karp
- Trees
- InOrder Traversal
- PreOrder Traversal
- PostOrder Traversal
- Morris Traversal
-
General Purpose
- Move
- Fill
- Swap (Todo: have to use move semantics)
-
Converters
- String to Int
- Int to String
- Int to String
-
Dynamic Programming
- LCS
- LIS
- LDS
- Progressions
- Arithmetic Progression
- Geometric Progression
- Permutaions and Combinations
- Factorial