Skip to content
← Published challenges

Checkpoint · revision 1

Algorithmic Thinking Checkpoint

Check whether you can compare algorithms by growth, preconditions, and trade-offs instead of appearance alone.

Scenario

You must choose an approach for inputs that may grow from tens to millions of items.

Scored questions

Question 1

Which growth rate best describes binary search on a sorted array?

Question 2

What must be true before ordinary binary search can be used correctly?

Question 3

If an O(n²) algorithm receives 100 items, how many pair positions are represented by n² in this simple growth model?

Question 4

Which statement is the most responsible complexity comparison?

Answer keys, scoring tolerance, XP, and awards stay on the server. Retrying the same attempt cannot award twice.