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 1640
MAJ Majority Element 1259
MER Merge Two Sorted Arrays 1327
2SUM 2SUM 869
HEA Building a Heap 566
MS Merge Sort 895
PAR 2-Way Partition 669
3SUM 3SUM 507
HS Heap Sort 460
INV Counting Inversions 494
PAR3 3-Way Partition 538
MED Median 445
PS Partial Sort 387
QS Quick Sort 398