⬅️ C++
- 1 DIMENSIONAL ARRAY
- 2 DIMENSIONAL ARRAY
- 3 DIMENSIONAL ARRAY
- 4 DIMENSIONAL ARRAY
- INBUILT
- ARRAY CLASS
- MISC
- HEAPED 1D ARRAY
- HEAPED 2D ARRAY
- HEAPED 3D ARRAY
- JAGGED ARRAY
- SINGLE
- DOUBLE
- CIRCULAR
- MEMORY EFFICIENT DOUBLE LINKED LIST
- UNROLLED LINKED LIST
- SKIP LIST
- INBUILT LISTS
- MISC
- FIXED ARRAY STACK
- DYNAMIC ARRAY STACK
- LINKED STACK
- INBUILT STACKS
- MISC
- SIMPLE QUEUE
- FIXED ARRAY SIMPLE QUEUE
- DYNAMIC ARRAY SIMPLE QUEUE
- LINKED SIMPLE QUEUE
- CIRCULAR QUEUE
- FIXED ARRAY CIRCULAR QUEUE
- LINKED CIRCULAR QUEUE
- PRIORITY QUEUE
- FIXED ARRAY PRIORITY QUEUE
- LINKED PRIORITY QUEUE
- HEAPED PRIORITY QUEUE
- BINARY TREE
- GENERIC TREES
- THREADED BINARY TREE
- XOR TREES
- BINARY SEARCH TREE
- AVL TREES
- RED BLACK TREES
- SPLAY TREES
- AUGMENTED TREES
- SCAPEGOAT TREES
- INTERVAL TREES
- HEAP TREE
- PAIR WISE SWAP
- REVERSE A NUMBER
- PAGE REPLACEMENT ALGORITHMS
- FIFO
- LRU
- OPTIMAL
- BINARY SEARCH
- LINEAR SEARCH
Run on terminal using commands below:
g++ sample.cpp -o sample.out
./sample.out