Homework before week 2¶

This week will we cover some basic algorithmic techniques:

sorting
binary search
BFS and DFS search in graphs.

Homework reading¶

We will follow Competitive Programmer’s Handbook by Antti Laaksonen. Please read (at least) the following parts to prepare for week 2:

Chapter 3: Sorting (including Section 3.3: Binary search)
Chapter 12: Graph traversal (covers BFS and DFS).

Homework problems¶

You will find here a mini-contest with two tasks: cses.fi/461/list/. Please ask in Zulip if you need any help with solving the homework tasks!

To complete the homework, solve these tasks before the contest closes. Please use your own personal CSES account. Once you have completed the homework contest, please submit the following form:

A+ presents the exercise submission form here.