Skip to content

Conversation

@prasxor
Copy link

@prasxor prasxor commented Dec 10, 2025

  • Implemented all greedy algorithms from CPH Chapter 6
    • Coin Problem (canonical greedy)
    • Interval Scheduling (earliest finish time)
    • Tasks & Deadlines (profit-based greedy)
    • Minimizing Sum of Differences (sorting strategy)
    • Huffman Coding (min-heap merges)
  • Added optimized Python 2 and Python 3 versions (index.py, index3.py)
  • Added fully redesigned, visually structured README.md
  • Ensured all functions are deterministic, minimal, and contest-ready

- Implemented all greedy algorithms from CPH Chapter 6
  - Coin Problem (canonical greedy)
  - Interval Scheduling (earliest finish time)
  - Tasks & Deadlines (profit-based greedy)
  - Minimizing Sum of Differences (sorting strategy)
  - Huffman Coding (min-heap merges)
- Added optimized Python 2 and Python 3 versions (index.py, index3.py)
- Added fully redesigned, visually structured README.md
- Ensured all functions are deterministic, minimal, and contest-ready
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant