Ranking

Brzmi jak z generatora questów do cyberpunkowych gier planszowych Co do bubble sorta, pierwszy z brzegu benchmark na danych losowych: // data var input = []; for (var i = 0; i < 1000; i++) { input[i] = Math.round(Math.random() * 1000000); } Test case name Result Built-in Sort Built-in Sort x 3,581 ops/sec ±0.61% (23 runs sampled) Naive Quicksort Naive Quicksort x 535 ops/sec ±0.66% (63 runs sampled) Inplace Quicksort Inplace Quicksort x 8,959 ops/sec ±0.45% (66 runs sampled) Heap Sort Heap Sort x 7,333 ops/sec ±0.32% (41 runs sampled) Merge Sort Merge Sort x 587 ops/sec ±0.56% (64 runs sampled) Shell Sort Shell Sort x 6,143 ops/sec ±0.50% (66 runs sampled) Comb Sort Comb Sort x 5,849 ops/sec ±0.31% (66 runs sampled) Insertion Sort Insertion Sort x 2,432 ops/sec ±0.46% (66 runs sampled) Fast QuickSort Fast QuickSort x 9,156 ops/sec ±0.49% (65 runs sampled) mSort mSort x 622 ops/sec ±0.57% (64 runs sampled) Radix Bucket Sort Radix Bucket Sort x 3,280 ops/sec ±0.81% (64 runs sampled) Bubble Sort Bubble Sort x 551 ops/sec ±0.33% (64 runs sampled) Fastest: Fast QuickSort Slowest: Naive Quicksort