The docs for find's sort say,

The running time of your implementation must be in O(n), where n is the array’s size. Yes, linear! Keep in mind that 65,536 is a constant.

However, the code that we're replacing in helpers.c says,

// TODO: implement an O(n^2) sorting algorithm

Which do you want: O(n) or O(n^2)?

1 Answer 1


Follow the spec. The problem uses the same distro code for both the "less" and "more" versions, so the TODO is based on the "less" specs.

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .