Comparing
cod-2446-normalize-benchmarkmode-to-sampletime
(8cb09f5
) withmain
(4b7a767
)+39%
- Improvement
- 2
- Untouched
- 123
- Skipped
- 9
Benchmarks
134 total
insertionSort[100]
examples/example-gradle/src/jmh/java/com/thealgorithms/sorts/SortBenchmark.java::com.thealgorithms.sorts.SortBenchmark+39%
17.2 µs12.4 µs
timSort[1000]
examples/example-gradle/src/jmh/java/com/thealgorithms/sorts/SortBenchmark.java::com.thealgorithms.sorts.SortBenchmark+14%
168.4 µs147.2 µs
fibonacciBottomUp[10]
examples/example-gradle/src/jmh/java/bench/DynamicProgrammingBenchmark.java::bench.DynamicProgrammingBenchmark+10%
480 ns437 ns
editDistance[kitten]
examples/example-gradle/src/jmh/java/bench/DynamicProgrammingBenchmark.java::bench.DynamicProgrammingBenchmark+8%
1.6 µs1.4 µs
fibonacciMemo[20]
examples/example-gradle/src/jmh/java/bench/DynamicProgrammingBenchmark.java::bench.DynamicProgrammingBenchmark+7%
30 ns28 ns
fib[30]
examples/example-gradle/src/jmh/java/bench/FibBenchmark.java::bench.FibBenchmark+7%
9.9 ms9.3 ms
shellSort[100]
examples/example-gradle/src/jmh/java/com/thealgorithms/sorts/SortBenchmark.java::com.thealgorithms.sorts.SortBenchmark+5%
6.8 µs6.5 µs
insertionSort[1000]
examples/example-gradle/src/jmh/java/com/thealgorithms/sorts/SortBenchmark.java::com.thealgorithms.sorts.SortBenchmark+4%
1.9 ms1.8 ms
heapSort[10000]
examples/example-gradle/src/jmh/java/com/thealgorithms/sorts/SortBenchmark.java::com.thealgorithms.sorts.SortBenchmark+4%
3.6 ms3.4 ms
mergeSort[10000]
examples/example-gradle/src/jmh/java/com/thealgorithms/sorts/SortBenchmark.java::com.thealgorithms.sorts.SortBenchmark+3%
2.9 ms2.8 ms
multiPatternScan[24]
examples/example-gradle/src/jmh/java/bench/RegexBenchmark.java::bench.RegexBenchmark+3%
6.2 ms6 ms
generateParentheses[3]
examples/example-gradle/src/jmh/java/bench/BacktrackingBenchmark.java::bench.BacktrackingBenchmark+3%
869 ns843 ns
nQueensSolver[6]
examples/example-gradle/src/jmh/java/bench/BacktrackingBenchmark.java::bench.BacktrackingBenchmark+3%
14.3 µs13.9 µs
generateCombinations[7]
examples/example-gradle/src/jmh/java/bench/BacktrackingBenchmark.java::bench.BacktrackingBenchmark+3%
12.9 µs12.6 µs
selectionSort[1000]
examples/example-gradle/src/jmh/java/com/thealgorithms/sorts/SortBenchmark.java::com.thealgorithms.sorts.SortBenchmark+2%
2.2 ms2.2 ms
compileAndMatch[20]
examples/example-gradle/src/jmh/java/bench/RegexBenchmark.java::bench.RegexBenchmark+2%
3.7 ms3.6 ms
fibonacciBottomUp[30]
examples/example-gradle/src/jmh/java/bench/DynamicProgrammingBenchmark.java::bench.DynamicProgrammingBenchmark+2%
2.7 µs2.7 µs
generateSubsequences[10]
examples/example-gradle/src/jmh/java/bench/BacktrackingBenchmark.java::bench.BacktrackingBenchmark+2%
77.6 µs76.5 µs
generateCombinations[5]
examples/example-gradle/src/jmh/java/bench/BacktrackingBenchmark.java::bench.BacktrackingBenchmark+1%
4.1 µs4.1 µs
timSort[100]
examples/example-gradle/src/jmh/java/com/thealgorithms/sorts/SortBenchmark.java::com.thealgorithms.sorts.SortBenchmark+1%
10.9 µs10.9 µs
nQueensSolver[4]
examples/example-gradle/src/jmh/java/bench/BacktrackingBenchmark.java::bench.BacktrackingBenchmark+1%
1.4 µs1.4 µs
fibonacciBottomUp[40]
examples/example-gradle/src/jmh/java/bench/DynamicProgrammingBenchmark.java::bench.DynamicProgrammingBenchmark+1%
3.3 µs3.3 µs
dualPivotQuickSort[100]
examples/example-gradle/src/jmh/java/com/thealgorithms/sorts/SortBenchmark.java::com.thealgorithms.sorts.SortBenchmark+1%
14.3 µs14.2 µs
decode[65536]
examples/example-gradle/src/jmh/java/bench/RleBenchmark.java::bench.RleBenchmark+1%
191.4 µs190.3 µs
levenshteinDistance[kitten sitting]
examples/example-gradle/src/jmh/java/bench/DynamicProgrammingBenchmark.java::bench.DynamicProgrammingBenchmark+1%
359 ns357 ns
Commits
Click on a commit to change the comparison rangeBase
main
4b7a767
+38.73%
feat(jmh-fork): add CodSpeed mode to capture raw ops and duration per iteration
8cb09f5
2 days ago
by not-matthias