This repository contains all the algorithms I’ve learned during my time at university. The goal is to document my progress, build a personal reference, and help others who are studying similar topics.

The algorithms are organized by topic:

• Sorting Algorithms

  • Bubble Sort
  • Selection Sort
  • Insertion Sort
  • Merge Sort
  • Quick Sort
  • Counting Sort

• Searching Algorithms

  • Linear Search
  • Binary Search

• Linked List

  • Singly
  • Doubly
  • Circular

• Graph Algorithms

  • Breadth-First Search (BFS)
  • Depth-First Search (DFS)
  • Dijkstra’s Algorithm
  • Bellman-Ford Algorithm

• Dynamic Programming

  • Fibonacci (Memoization & Tabulation)
  • Longest Common Subsequence (LCS)
  • 0/1 Knapsack

• Divide and Conquer

  • Merge Sort
  • Quick Sort

• Greedy Algorithms

  • Activity Selection
  • Fractional Knapsack

• Backtracking

  • N-Queens Problem
  • Sudoku Solver

• Other Topics

  • Stack
  • Queue
  • Recursion Practice
  • Complexity Analysis
  • Selected Assignment/Contest Problems

Most of the implementations are written in:

• Python

• 📖 To revise and strengthen my understanding of core algorithms
• 🧩 To keep all my learning in one place
• 🤝 To help fellow university students preparing for exams or interviews