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 2254
MAJ Majority Element 1756
MER Merge Two Sorted Arrays 1833
2SUM 2SUM 1194
HEA Building a Heap 724
MS Merge Sort 1243
PAR 2-Way Partition 911
3SUM 3SUM 710
HS Heap Sort 588
INV Counting Inversions 691
PAR3 3-Way Partition 749
MED Median 626
PS Partial Sort 501
QS Quick Sort 525