Maybe it was too hard.
Here's another problem that might be easier. Make an O(n log n) sorting algorithm that's simple, stable, and in place. Today you can only get two out of three (merge sort isn't in place, heap sort isn't stable, and block sort isn't simple).
If it's worth saying, but not worth its own post, then it goes here.
Notes for future OT posters:
1. Please add the 'open_thread' tag.
2. Check if there is an active Open Thread before posting a new one. (Immediately before; refresh the list-of-threads page before posting.)
3. Open Threads should start on Monday, and end on Sunday.
4. Unflag the two options "Notify me of new top level comments on this article" and "