🧮 Java Algorithms & Data Structures

This repository is a curated collection of Java implementations of classic algorithms and data structures, built for practice, learning, and interview preparation. Each folder covers a specific algorithmic category or problem type, with clean and well-documented code.

📂 Repository Structure

Sorting Algorithms

QuickSort – Divide and conquer sorting
MergeSort – Stable recursive sorting
CountingSort – Non-comparative integer sorting
RadixSort – Digit-by-digit integer sorting
BucketSort – Distribution-based sorting
InsertionSort – Simple comparison sorting

Graph Algorithms

Graph_Algorithms – Implementations of BFS, DFS, and traversal utilities
Minimum_Spanning_Trees – Kruskal’s and Prim’s algorithms
Shortest_Paths – Dijkstra’s, Bellman-Ford, and Floyd-Warshall
Maximum_Flow – Ford-Fulkerson and Edmonds-Karp

Data Structures

HashMap – Efficient lookup, hashing, and duplicate detection

Other Categories

DynamicProgramming – Classic DP problems (e.g., knapsack, LIS)
GreedyAlgs – Greedy algorithmic strategies
Armortized_Algorithms – Amortized analysis and optimized structures
DataMining – Experimental algorithms for data-driven analysis
ExtraPrac – Additional practice problems

🚀 Features

Covers fundamental algorithms required in computer science, coding interviews, and competitive programming
Written in pure Java with no external dependencies
Easy-to-read implementations designed for clarity and educational value
Includes a mix of sorting, graph theory, dynamic programming, greedy, and hashing techniques

🛠️ Technologies

Language: Java (100%)
Paradigm: Object-Oriented Programming (OOP)
Tools: Any Java IDE (IntelliJ, Eclipse, VS Code)

📌 Getting Started

Clone the repo:

git clone https://github.com/Philipst77/Algorithms.git
cd Algorithms

Algorthims

Install / Use

README