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 1392
MAJ Majority Element 1074
MER Merge Two Sorted Arrays 1123
2SUM 2SUM 745
HEA Building a Heap 492
MS Merge Sort 769
PAR 2-Way Partition 581
3SUM 3SUM 434
HS Heap Sort 397
INV Counting Inversions 423
PAR3 3-Way Partition 464
MED Median 387
PS Partial Sort 328
QS Quick Sort 347