In computer science, an algorithm is simply a step-by-step set of instructions to solve a problem or perform a task.

• Algorithms Types

• Common Algorithms

• Graph

  • Graph-Traversal
    • BFS
    • DFS
  • Shortest Path Algorithms
    • Dijkstra’s Algorithm
    • Bellman–Ford Algorithm
    • Floyd–Warshall Algorithm
    • A* Search
  • Minimum Spanning Tree Algorithms
    • Prim’s Algorithm
    • Kruskal’s Algorithm
  • Other Graph Problems
    • Topological Sort (DAGs)
    • Connectivity (Union-Find / DSU)
    • Cycle Detection

• Tree

  • Tree-Traversal
    • Preorder
    • Inorder
    • Postorder
    • LevelOrder (BFS Style)
  • Balancing
    • AVL Tree Rotations
    • Red-Black Tree Fixes
  • Heap Operations
    • Heapify
    • Insert / Delete in Heap
    • HeapSort
  • Other Tree Problems
    • Lowest Common Ancestor (LCA)
    • Segment Tree Operations
    • Fenwick Tree (Binary Indexed Tree)

• Sort

  • QuickSort
  • MergeSort
  • HeapSort
  • BubbleSort
  • InsertionSort
  • SelectionSort

• Search

  • Binary Search
  • Linear Search

• Divide-and-conquer

  • MergeSort
  • QuickSort
  • BinarySearch

• Gaming

  • Pathfinding
    • A* Search
    • Dijkstra’s
    • Jump Point Search
  • Decision Making
    • Minmax Algorithm
    • Monte Carlo Tree Search (MCTS)
    • Finite State Machines (FSM) for NPC Bahavior
  • Procedural Generation
    • Perlin Noise / Simplex Noise (terrain, textures)
    • Random Walk / Drunkard’s Walk (dungeons, caves)
    • Cellular Automata (roguelike maps, cave systems)
  • Collision & Physics
    • Bounding Box / Circle Collision Detection
    • Quadtrees / Octrees (space partitioning for collision checks)
    • Separating Axis Theorem (SAT) for convex shapes

• Challenges

• General-Purpose Algorithms

  • Dynamic Programming
    • Fibonacci (DP)
    • Longest Common Subsequence (LCS)
    • Knapsack Problem
    • Matrix Chain Multiplication
  • Greedy Algorithms
    • Huffman Coding
    • Activity Selection
    • Coin Change (greedy variant)

• Parallel Algorithm