Summary
Summary Greedy Algorithms
Rating
Sold
-
Pages
12
Uploaded on
05-02-2024
Written in
2023/2024
A greedy algorithm is an algorithmic strategy that makes the optimal choice at each small stage (subproblem), with the goal of eventually leading to globally optimum solution. This document explains the definition of a greedy algorithm, the difference between greedy algorithm and dynamic programming and it provides a explanation of some greedy algorithms as Huffman Encoding, Minimum Spanning Tree (MST) and its different algorithms, graph review and Shortest-Path algorithm.
Show more
Read less
Institution
Course
Whoops! We can’t load your doc right now. Try again or contact support.
Written for
- Institution
- Cairo University
- Course
- CS321 (ALGORITHMS)
All documents for this subject (6)
Document information
- Uploaded on
- February 5, 2024
- Number of pages
- 12
- Written in
- 2023/2024
- Type
- SUMMARY
Subjects
-
greedy algorithms
-
algorithms
-
programming
-
analysis
-
optimization
-
dynamic programming
-
recurrence
-
recursion
-
huffman encoding
-
minimum spanning tree
-
traveling salesman
-
complexity
-
dijkstras algorithm
-
dijkstr
$10.99
Get access to the full document:
Wrong document? Swap it for free
Within 14 days of purchase and before downloading, you can choose a different document. You can simply spend the amount again.
Written by students who passed
Immediately available after payment
Read online or as PDF
Get to know the seller
roaaemaduldin
Also available in package deal
Package deal
Algorithms Analysis and Design
6
2024
$ 53.94
More info
