Course page Home page Home page CoursesNew course

Greedy algorithms and optimization: Computer Science course | Zoonk

26. Greedy algorithms and optimization

Use greedy choice, local improvement, approximation, and constraint thinking for problems where perfect exhaustive search is too expensive. You will practice recognizing when a greedy strategy is valid and when it quietly fails.

Computer Science

Create this chapter

This chapter is part of the course, but it hasn't been created yet. Create it to see all of its lessons.

Create chapterNBack to courseEsc