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 2069
MAJ Majority Element 1616
MER Merge Two Sorted Arrays 1693
2SUM 2SUM 1110
HEA Building a Heap 681
MS Merge Sort 1150
PAR 2-Way Partition 855
3SUM 3SUM 663
HS Heap Sort 552
INV Counting Inversions 645
PAR3 3-Way Partition 701
MED Median 585
PS Partial Sort 471
QS Quick Sort 488