Think about using binary search and mergesort, or devising your own divide-and-conquer algorithm. Implement and test your algorithm.
Dutch-national-flag problem. Design a linear-time algorithm to sort an array of Comparable objects that is known to have at most three distinct values. (Edsgar Dijkstra named this the Dutch-national-flag problem because the result is three “stripes” of values like the three stripes in the flag.)
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.