$ node sort/merge/example.js
input = [ 707, 828, 511, 388, 517, 392, 411, 296, 256, 688 ]
valid = [ 256, 296, 388, 392, 411, 511, 517, 688, 707, 828 ]
output = [ 256, 296, 388, 392, 411, 511, 517, 688, 707, 828 ]
n = 10
O(n * log2(n)) = 33
iterationCount = 25
$ node sort/qsort/example.js
input = [ 784, 514, 222, 679, 433, 740, 940, 909, 548, 943 ]
valid = [ 222, 433, 514, 548, 679, 740, 784, 909, 940, 943 ]
output = [ 222, 433, 514, 548, 679, 740, 784, 909, 940, 943 ]
n = 10
O(n * log2(n)) = 33
iterationCount = 27