Data Structures and Algorithms

Welcome! This repository is organized around two modules with comprehensive implementations and explanations.

Introduction

• Introduction to DSA - Core concepts and definitions
• Complexity Analysis - Big-O, Omega, Theta notations

Module Structure

• DSA: Foundations (core data structures, elementary algorithms, basic complexity)
• ADSA: Advanced topics (advanced sorting, self-balancing trees, hashing theory, heaps, graph algorithms)

Note: DSA and ADSA contain detailed outlines for reference.

DSA (Foundations)

• Data Structures (DS)

  Linear

  • Arrays
  • Linked Lists
  • Stacks
  • Queues
  Non-Linear

  • Trees
  • Heaps
  • Hash Tables
  • Graphs

• Algorithms (Algo)

  Searching

  • Linear Search
  • Binary Search
  Sorting (Elementary)

  • Bubble Sort
  • Selection Sort
  • Insertion Sort
  Other Core Topics

  • Recursion
  • Divide and Conquer
  • Mathematical Algorithms
  • String Algorithms
  • Bit Manipulation

ADSA (Advanced)

• Data Structures (Advanced DS)

  • Red-Black Trees
  • Heaps (Priority Queues)
  • Hash Tables (Open Addressing, Chaining)

• Algorithms (Advanced Algo)

  Sorting (Advanced)

  • Merge Sort
  • Quick Sort
  • Shell Sort
  • Counting Sort
  • Radix Sort
  Graph Algorithms

  • DFS
  • BFS
  • Minimum Spanning Tree (Kruskal)
  • Shortest Path (Dijkstra)
  Other Advanced Topics

  • Dynamic Programming
  • Greedy Algorithms
  • Randomized Algorithms
  • Geometric Algorithms
  • Branch and Bound
  • Hashing

• Intro (Theory)

  • Complexity Analysis (Big-O/Ω/θ) — optional theory index; see DSA and ADSA for outlines.