Algorithm Analysis Project

Introduction

This project demonstrates five different algorithms, each solving a unique computational problem.

Each problem includes:

• Problem description
• Source code
• Screenshots of the program running
• Link to the GitHub repository

---

Problem 1 — Binary Search

Description: Efficiently locate a target value inside a sorted array.

Repo: https://github.com/YOUR_USERNAME/algorithm-binary-search

---

Problem 2 — Dijkstra Shortest Path

Description: Find the shortest distance between nodes in a weighted graph.

Repo: https://github.com/YOUR_USERNAME/algorithm-dijkstra

---

Problem 3 — Merge Sort

Description: Sort an unsorted list using the divide-and-conquer merge sort algorithm.

Repo: https://github.com/YOUR_USERNAME/algorithm-merge-sort

---

Problem 4 — Knapsack Dynamic Programming

Description: Determine the maximum value that can fit in a knapsack with limited capacity.

Repo: https://github.com/YOUR_USERNAME/algorithm-knapsack-dp

---

Problem 5 — A* Pathfinding

Description: Find the shortest path in a grid with obstacles using heuristic search.

Repo: https://github.com/YOUR_USERNAME/algorithm-a-star