Greedy Techniques

Greedy Algorithms is not an algorithm but an algorithmic paradigm where we are greedy about the current best and hope that current best will lead to global best.This course discusses greedy algorithms as an algorithmic paradigm and some problems that are solved using greedy algorithms

GATE (Graduate Aptitude Test in Engineering) 2020 & 2021 complete preparation with best educators. Know about the detailed syllabus, best books, exam pattern and dates, previous year question papers a

GATE & ESE

Hindi

(Hindi) Greedy Algorithms

Algorithms

CS & IT

GATE - CSIT, DSAI & Interview Preparation

GATE, ESE and IIT-JAM

Kruskal's Minimal Spanning Tree Algorithm is used to find aminimal spanning tree from a given Graph.In this lesson Kruskal's algorithm is discussed along with examples.

Kruskal's Minimal Spanning Tree Algorithm (in Hindi)

Introduction (in Hindi)

Knapsack Problem (in Hindi)

Task Scheduling Problem (in Hindi)

Huffman Coding (in Hindi)

Optimal Merge Pattern (in Hindi)

Please Login To Continue

Kruskal's Minimal Spanning Tree Algorithm (in Hindi)

Akansha Aggarwal

(Hindi) Greedy Algorithms

1

2

3

4

5

6

Crack GATE & ESE with Unacademy

Get subscription and access unlimited live and recorded courses from India's best educators

Structured syllabus

Daily live classes

Ask doubts

Tests & practice

Similar Plus Courses

Course on Diversity in Living Organism

Seep Pahuja

Course on Inorganic Chemistry for NEET UG 2025

Ramesh Sharda

Course on Basics of Organic Chemistry for NEET UG 2025

Shubh Karan Choudhary (Skc)