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 1236
MAJ Majority Element 968
MER Merge Two Sorted Arrays 1010
2SUM 2SUM 683
HEA Building a Heap 454
MS Merge Sort 692
PAR 2-Way Partition 527
3SUM 3SUM 403
HS Heap Sort 367
INV Counting Inversions 385
PAR3 3-Way Partition 423
MED Median 355
PS Partial Sort 304
QS Quick Sort 316