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 1195
MAJ Majority Element 941
MER Merge Two Sorted Arrays 984
2SUM 2SUM 665
HEA Building a Heap 444
MS Merge Sort 675
PAR 2-Way Partition 517
3SUM 3SUM 388
HS Heap Sort 355
INV Counting Inversions 373
PAR3 3-Way Partition 413
MED Median 344
PS Partial Sort 294
QS Quick Sort 306