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 1896
MAJ Majority Element 1476
MER Merge Two Sorted Arrays 1546
2SUM 2SUM 1008
HEA Building a Heap 637
MS Merge Sort 1041
PAR 2-Way Partition 775
3SUM 3SUM 601
HS Heap Sort 517
INV Counting Inversions 575
PAR3 3-Way Partition 630
MED Median 522
PS Partial Sort 439
QS Quick Sort 449