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 2169
MAJ Majority Element 1690
MER Merge Two Sorted Arrays 1768
2SUM 2SUM 1154
HEA Building a Heap 701
MS Merge Sort 1194
PAR 2-Way Partition 883
3SUM 3SUM 687
HS Heap Sort 570
INV Counting Inversions 666
PAR3 3-Way Partition 728
MED Median 609
PS Partial Sort 489
QS Quick Sort 508