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 1596
MAJ Majority Element 1237
MER Merge Two Sorted Arrays 1296
2SUM 2SUM 859
HEA Building a Heap 563
MS Merge Sort 875
PAR 2-Way Partition 664
3SUM 3SUM 505
HS Heap Sort 456
INV Counting Inversions 491
PAR3 3-Way Partition 533
MED Median 442
PS Partial Sort 383
QS Quick Sort 394