README.md

⬅️ C

INDEX

🚀 CONVERSIONS

• Binary to Decimal

🚀 DATA STRUCTURES

ARRAYS

• 1 DIMENSIONAL ARRAYS
• 2 DIMENSIONAL ARRAYS
• 3 DIMENSIONAL ARRAYS
• 4 DIMENSIONAL ARRAYS
• MISC
  • 1D ARRAYS USING HEAPS
  • 2D ARRAYS USING HEAPS
  • 3D ARRAYS USING HEAPS
  • JAGGED ARRAYS

STRING

LISTS

• LINKED LIST
  • SINGLE
    • SINGLE LINKED LIST
  • DOUBLE
    • DOUBLE LINKED LIST
  • CIRCULAR
• MEMORY EFFICIENT DOUBLE LINKED LIST
• UNROLLED LINKED LIST
• SKIP LIST
• MISC

STACKS

• FIXED ARRAY STACK
• DYNAMIC ARRAY STACK
• LINKED STACK
• MISC
  • Minimum bracket reversal for balanced expression
  • Postfix Evaluation

QUEUES

• SIMPLE QUEUE
  • FIXED ARRAY
  • DYNAMIC ARRAY
  • LINKED
• CIRCULAR QUEUE
  • FIXED ARRAY
  • LINKED
• PRIORITY QUEUE
  • FIXED ARRAY
  • DYNAMIC ARRAY
  • LINKED

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

• Fibonacci Series
• SPELL THE NUMBER

🚀 SEARCHING

• Linear Search

  • Without recursion
  • With recursion

• Binary Search

  • Without recursion
  • With recursion

🚀 SORTING

• BUBBLE SORT
  • ASCENDING AND STABLE
  • DESCENDING AND STABLE
  • ASCENDING AND UNSTABLE
  • DESCENDING AND UNSTABLE
• SELECTION SORT (UNSTABLE)
  • ASCENDING
    • Using max element
    • Using min element
  • DESCENDING
    • Using max element
    • Using min element
• INSERTION SORT
  • ASCENDING
    • START FROM LEFT
    • START FROM RIGHT
  • DESCENDING
    • START FROM LEFT
    • START FROM RIGHT

🚀 STRINGS

• reverse a string

🚀 EXECUTION OF C CODE

LINUX

Run on terminal using commands below:

gcc sample.c -o sample.out
./sample.out