⚡ Java Algorithms & Problem Solving Hub

---

🌟 About The Repository

This repository is a curated collection of Data Structures & Algorithms implemented in Java.

Whether you're preparing for:

🎯 Coding Interviews
🎯 Placement Exams
🎯 Competitive Programming
🎯 University Coursework

this repository provides clean and beginner-friendly implementations of important algorithms.

---

📂 Algorithm Collection

🔍 Searching Algorithms

Algorithm	Time Complexity
Linear Search	O(n)
Binary Search	O(log n)

---

⚙️ Sorting Algorithms

Algorithm	Best	Average	Worst
Bubble Sort	O(n)	O(n²)	O(n²)
Selection Sort	O(n²)	O(n²)	O(n²)
Insertion Sort	O(n)	O(n²)	O(n²)
Merge Sort	O(n log n)	O(n log n)	O(n log n)
Quick Sort	O(n log n)	O(n log n)	O(n²)
Heap Sort	O(n log n)	O(n log n)	O(n log n)
Counting Sort	O(n+k)	O(n+k)	O(n+k)
Radix Sort	O(nk)	O(nk)	O(nk)

---

🎯 Greedy Algorithms

✅ Activity Selection

✅ Fractional Knapsack

✅ Job Scheduling

✅ Dijkstra's Algorithm

✅ Prim's Algorithm

---

⚡ Dynamic Programming

✅ Longest Common Subsequence (LCS)

✅ Matrix Chain Multiplication

---

🌳 Branch & Bound

✅ 0/1 Knapsack

✅ N-Queens Problem

---

🗂️ Repository Structure

📦 Java-Algorithms-and-Data-Structures
├── 🔍 Searching
├── ⚙️ Sorting Problems
├── 🎯 Greedy Problems
├── ⚡ Dynamic Problems
└── 🌳 Branch and Bound Problems

---

🚀 Quick Start

# Clone repository
git clone https://github.com/Rekshit/Data-Analysis-and-Algorithm.git

# Open project
cd Data-Analysis-and-Algorithm

# Compile
javac FileName.java

# Run
java FileName

---

📈 Learning Roadmap

Searching
    ↓
Sorting
    ↓
Greedy Algorithms
    ↓
Dynamic Programming
    ↓
Branch & Bound

---

🎖️ Skills Demonstrated

✔ Problem Solving

✔ Algorithm Design

✔ Time Complexity Analysis

✔ Java Programming

✔ Dynamic Programming

✔ Greedy Strategies

✔ Optimization Techniques

---

⭐ If you find this repository useful, consider giving it a star!