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 2328
MAJ Majority Element 1820
MER Merge Two Sorted Arrays 1898
2SUM 2SUM 1238
HEA Building a Heap 747
MS Merge Sort 1282
PAR 2-Way Partition 947
3SUM 3SUM 738
HS Heap Sort 605
INV Counting Inversions 709
PAR3 3-Way Partition 775
MED Median 648
PS Partial Sort 514
QS Quick Sort 543