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 1467
MAJ Majority Element 1127
MER Merge Two Sorted Arrays 1184
2SUM 2SUM 784
HEA Building a Heap 513
MS Merge Sort 805
PAR 2-Way Partition 612
3SUM 3SUM 459
HS Heap Sort 416
INV Counting Inversions 448
PAR3 3-Way Partition 491
MED Median 405
PS Partial Sort 345
QS Quick Sort 362