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 2311
MAJ Majority Element 1807
MER Merge Two Sorted Arrays 1882
2SUM 2SUM 1227
HEA Building a Heap 742
MS Merge Sort 1271
PAR 2-Way Partition 937
3SUM 3SUM 731
HS Heap Sort 601
INV Counting Inversions 704
PAR3 3-Way Partition 767
MED Median 642
PS Partial Sort 512
QS Quick Sort 538