README.md

⬅️ C++

INDEX

🚀 CONVERSIONS

🚀 DATA STRUCTURES

ARRAYS

• 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

STRING

• Strings

LISTS

• SINGLE
  • SINGLE
• DOUBLE
• CIRCULAR
• MEMORY EFFICIENT DOUBLE LINKED LIST
• UNROLLED LINKED LIST
• SKIP LIST
• INBUILT LISTS
  • VECTORS
• MISC

STACKS

• FIXED ARRAY STACK
  • STACK
  • USAGE
• DYNAMIC ARRAY STACK
• LINKED STACK
• INBUILT STACKS
  • STACK CLASS
• MISC
  • TWO WAY
    • STACK
    • USAGE

QUEUES

• 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

HASHTABLE

TREES

• 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

GRAPHS

BLOCKCHAIN

🚀 DYNAMIC PROGRAMMING

🚀 MISC

• PAIR WISE SWAP
• REVERSE A NUMBER
• PAGE REPLACEMENT ALGORITHMS
  • FIFO
  • LRU
    • Using my own Queue
  • OPTIMAL

🚀 SEARCHING

• BINARY SEARCH
• LINEAR SEARCH
  • SIMPLE
  • COMPLEX

🚀 SORTING

• BUBBLE SORT
• SELECTION SORT
• SHELL SORT
• MERGE SORT
• HEAP SORT

🚀 EXECUTION OF C++ CODE

LINUX

Run on terminal using commands below:

g++ sample.cpp -o sample.out
./sample.out