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 1529
MAJ Majority Element 1182
MER Merge Two Sorted Arrays 1240
2SUM 2SUM 815
HEA Building a Heap 535
MS Merge Sort 833
PAR 2-Way Partition 634
3SUM 3SUM 477
HS Heap Sort 433
INV Counting Inversions 466
PAR3 3-Way Partition 507
MED Median 418
PS Partial Sort 361
QS Quick Sort 374