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 1847
MAJ Majority Element 1436
MER Merge Two Sorted Arrays 1505
2SUM 2SUM 984
HEA Building a Heap 618
MS Merge Sort 1013
PAR 2-Way Partition 754
3SUM 3SUM 581
HS Heap Sort 503
INV Counting Inversions 562
PAR3 3-Way Partition 613
MED Median 508
PS Partial Sort 425
QS Quick Sort 436