The problem of finding a smallest collection of operations that changes a structure into a nicely ordered one.

ID Title Solved By Correct Ratio
INS Insertion Sort 1215
MAJ Majority Element 956
MER Merge Two Sorted Arrays 998
2SUM 2SUM 675
HEA Building a Heap 451
MS Merge Sort 686
PAR 2-Way Partition 524
3SUM 3SUM 396
HS Heap Sort 363
INV Counting Inversions 380
PAR3 3-Way Partition 420
MED Median 353
PS Partial Sort 302
QS Quick Sort 314