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 2421
MAJ Majority Element 1890
MER Merge Two Sorted Arrays 1964
2SUM 2SUM 1282
HEA Building a Heap 779
MS Merge Sort 1324
PAR 2-Way Partition 978
3SUM 3SUM 761
HS Heap Sort 627
INV Counting Inversions 730
PAR3 3-Way Partition 798
MED Median 669
PS Partial Sort 535
QS Quick Sort 562