BiteSizedChunks.comLearn one small thing at a time.

Course contentsShow

Computer Science

878What Makes an Algorithm Greedy?
879The Greedy Choice Property
880Optimal Substructure in Greedy Problems
881Greedy vs Dynamic Programming
882Activity Selection Problem
883Exchange Arguments for Correctness
884Greedy Stays Ahead Proofs
885When Greedy Fails
886Designing Greedy Algorithms
887Greedy Algorithm Complexity
888Activity Selection Problem
889Fractional Knapsack Problem
890Huffman Coding for Data Compression
891Job Sequencing with Deadlines
892Minimum Number of Coins Problem
893Gas Station Circuit Problem
894Meeting Room Scheduling
895Egyptian Fraction Representation
896Minimum Platforms Problem
897Maximum Length Chain of Pairs
898Minimum Product Subset
899Connect N Ropes with Minimum Cost
900Policemen Catch Thieves Problem
901Minimize Maximum Difference in Heights
902Buy Maximum Stocks with K Transactions
903Introduction to Greedy Correctness Proofs
904The Greedy Choice Property
905Optimal Substructure in Greedy Algorithms
906Proof by Exchange Argument
907Proving Activity Selection Correctness
908Proving Huffman Coding Correctness
909Proving Fractional Knapsack Correctness
910Matroid Theory and Greedy Algorithms
911Counterexamples: When Greedy Fails
912Greedy vs Dynamic Programming Decision

Computer Science

878What Makes an Algorithm Greedy?
879The Greedy Choice Property
880Optimal Substructure in Greedy Problems
881Greedy vs Dynamic Programming
882Activity Selection Problem
883Exchange Arguments for Correctness
884Greedy Stays Ahead Proofs
885When Greedy Fails
886Designing Greedy Algorithms
887Greedy Algorithm Complexity
888Activity Selection Problem
889Fractional Knapsack Problem
890Huffman Coding for Data Compression
891Job Sequencing with Deadlines
892Minimum Number of Coins Problem
893Gas Station Circuit Problem
894Meeting Room Scheduling
895Egyptian Fraction Representation
896Minimum Platforms Problem
897Maximum Length Chain of Pairs
898Minimum Product Subset
899Connect N Ropes with Minimum Cost
900Policemen Catch Thieves Problem
901Minimize Maximum Difference in Heights
902Buy Maximum Stocks with K Transactions
903Introduction to Greedy Correctness Proofs
904The Greedy Choice Property
905Optimal Substructure in Greedy Algorithms
906Proof by Exchange Argument
907Proving Activity Selection Correctness
908Proving Huffman Coding Correctness
909Proving Fractional Knapsack Correctness
910Matroid Theory and Greedy Algorithms
911Counterexamples: When Greedy Fails
912Greedy vs Dynamic Programming Decision

← Computer Science

Lesson 887 of 2,872·21. Greedy AlgorithmsPro lesson

Greedy Algorithm Complexity

Analyze runtime efficiency: greedy algorithms typically achieve O(n log n) with sorting step.

This lesson is for subscribers

You've completed the free preview. Subscribe to unlock every lesson in every course.

See pricing Back to course