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 1815
MAJ Majority Element 1408
MER Merge Two Sorted Arrays 1478
2SUM 2SUM 965
HEA Building a Heap 605
MS Merge Sort 993
PAR 2-Way Partition 731
3SUM 3SUM 565
HS Heap Sort 492
INV Counting Inversions 546
PAR3 3-Way Partition 592
MED Median 489
PS Partial Sort 415
QS Quick Sort 425