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 1273
MAJ Majority Element 992
MER Merge Two Sorted Arrays 1037
2SUM 2SUM 699
HEA Building a Heap 459
MS Merge Sort 706
PAR 2-Way Partition 532
3SUM 3SUM 408
HS Heap Sort 374
INV Counting Inversions 395
PAR3 3-Way Partition 428
MED Median 361
PS Partial Sort 308
QS Quick Sort 322