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 1945
MAJ Majority Element 1512
MER Merge Two Sorted Arrays 1590
2SUM 2SUM 1030
HEA Building a Heap 651
MS Merge Sort 1069
PAR 2-Way Partition 794
3SUM 3SUM 614
HS Heap Sort 528
INV Counting Inversions 591
PAR3 3-Way Partition 647
MED Median 536
PS Partial Sort 449
QS Quick Sort 462