Skip to content

README.md

Latest commit

 

History

History
99 lines (83 loc) · 2.49 KB

README.md

File metadata and controls

99 lines (83 loc) · 2.49 KB

DSA

This repository contains Java implementations of Data Structures and Algorithms developed during a Data Structures Bootcamp.
It is designed to help understand core concepts through clean, readable, and beginner-friendly code. The implementations prioritize simplicity and correctness over heavy optimization, making them suitable for learning, revision, and interview preparation.

Repository Overview:

The repository is organized into folders based on topic for better navigation and clarity.

Data-Structures:

This directory contains implementations of fundamental data structures in Java, including:

  • Graphs:
    • Graph (Adjacency List).
    • Graph (Adjacency Matrix).
    • Breadth-First Search (BFS).
    • Depth-First Search (DFS).
    • Dijkstra's algorithm.
  • Hashing:
    • Hash Table.
  • Linked List:
    • Circular Linked List.
    • Doubly Linked List.
    • Singly Linked List.
  • Queue:
    • Bounded Queue.
    • Circular Queue.
    • Priority Queue.
    • Linear Queue.
  • Stack:
    • Linear Stack.
  • Trees:
    • Trie:
      • Prefix Array.
      • Prefix Trie.
      • Suffix Array.
      • Suffix Trie.
      • Trie.
    • AVL Tree.
    • Binary Search Tree.
    • Binary Tree (manual traversal demo).
    • Binary Tree with insert/search/delete.

Searching-algorithms:

This directory includes Java implementations of common searching techniques:

  • Linear Search.
  • Binary Search.
  • Uniform Binary Search.
  • Fibonacci Search.
  • Interpolation Search.

The implementations demonstrate how different searching strategies behave under different conditions.

Sorting-algorithms:

This directory contains Java implementations of basic sorting algorithms such as:

  • Bubble Sort.
  • Selection Sort.
  • Insertion Sort.
  • Quick Sort.
  • Radix Sort.
  • Merge Sort.
  • Shell Sort.
  • Heap sort.

These programs are written to clearly show algorithm flow and logic rather than micro-optimizations.

Notes:

This directory contains Markdown notes created during the bootcamp sessions.
The notes explain:

  • Key concepts.
  • Algorithm intuition.
  • Important observations.
  • Day wise concepts.

Technology Stack:

  • Programming Language: Java.
  • Development Environment: Any Java-compatible IDE.
  • License: MIT.

How to Use This Repository?

  1. Clone the repository:

    git clone https://github.com/Pranav-173/DSA.git

    (or)

    git clone https://github.com/Nullkernel/DSA.git