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 1726
MAJ Majority Element 1333
MER Merge Two Sorted Arrays 1401
2SUM 2SUM 915
HEA Building a Heap 588
MS Merge Sort 945
PAR 2-Way Partition 698
3SUM 3SUM 536
HS Heap Sort 480
INV Counting Inversions 517
PAR3 3-Way Partition 562
MED Median 464
PS Partial Sort 404
QS Quick Sort 417