🔢
Algorithms & Data
Ctrlk
  • Overview
    • 1. Sort
    • 2. Data Structures
    • 3. How to construct Algorithm? Paradigm
      • Greedy Algorithm
        • Prim
        • Dijkstra
        • Prim vs Dijkstra
      • Dynamic Planning Techique
      • Dynamic Planning
      • Divide And Conquer
      • Brute force
      • Shortest path
      • MST (Minimum Spanning Tree)
  • Algorithm Problems
    • Problem Sources
    • AlgoExpert
    • Daily Algorithms
  • Top 75 LeetCode Questions to Save Your Time
    • Source
    • Problems
  • Tip
    • Page 2
    • LinkedList
Powered by GitBook
On this page
  1. Overview
  2. 3. How to construct Algorithm? Paradigm

Greedy Algorithm

PrimDijkstraPrim vs Dijkstra
Previous3. How to construct Algorithm? ParadigmNextPrim

Last updated 14 days ago