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 1352
MAJ Majority Element 1048
MER Merge Two Sorted Arrays 1098
2SUM 2SUM 726
HEA Building a Heap 478
MS Merge Sort 748
PAR 2-Way Partition 564
3SUM 3SUM 422
HS Heap Sort 388
INV Counting Inversions 413
PAR3 3-Way Partition 454
MED Median 377
PS Partial Sort 319
QS Quick Sort 338