Posts by Tags

Algorithms

Solution to CLRS Problem 16-1 (Coin Changing Problem)

less than 1 minute read

Published:

This post provides a detailed solution and analysis for Problem 16-1 (Coin Changing) from Introduction to Algorithms (CLRS). It discusses the conditions under which the greedy algorithm yields an optimal solution and when dynamic programming is required.

Amortized Analysis

C/C++

DFT

Data Structures

Dynamic Programming

Solution to CLRS Problem 16-1 (Coin Changing Problem)

less than 1 minute read

Published:

This post provides a detailed solution and analysis for Problem 16-1 (Coin Changing) from Introduction to Algorithms (CLRS). It discusses the conditions under which the greedy algorithm yields an optimal solution and when dynamic programming is required.

Greedy Algorithms

Solution to CLRS Problem 16-1 (Coin Changing Problem)

less than 1 minute read

Published:

This post provides a detailed solution and analysis for Problem 16-1 (Coin Changing) from Introduction to Algorithms (CLRS). It discusses the conditions under which the greedy algorithm yields an optimal solution and when dynamic programming is required.

Learning Notes

Materials Science

Operating Systems

Scheduling

Scheduling Algorithms

xv6