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 1426
MAJ Majority Element 1098
MER Merge Two Sorted Arrays 1153
2SUM 2SUM 765
HEA Building a Heap 504
MS Merge Sort 782
PAR 2-Way Partition 596
3SUM 3SUM 445
HS Heap Sort 408
INV Counting Inversions 437
PAR3 3-Way Partition 480
MED Median 397
PS Partial Sort 338
QS Quick Sort 355