From d8da2ef88376de0036e98455ad29830cf8fed653 Mon Sep 17 00:00:00 2001 From: mherbaghinyan Date: Wed, 23 Jan 2019 12:09:26 +0400 Subject: [PATCH] sorting algorithms benchmarks --- .../performance/ArraySortBenchmark.java | 22 +++++++++++-------- 1 file changed, 13 insertions(+), 9 deletions(-) diff --git a/core-java-collections/src/main/java/com/baeldung/performance/ArraySortBenchmark.java b/core-java-collections/src/main/java/com/baeldung/performance/ArraySortBenchmark.java index d7b31d2aa5..371146122c 100644 --- a/core-java-collections/src/main/java/com/baeldung/performance/ArraySortBenchmark.java +++ b/core-java-collections/src/main/java/com/baeldung/performance/ArraySortBenchmark.java @@ -11,8 +11,8 @@ import java.util.Collections; import java.util.List; import java.util.concurrent.TimeUnit; -@BenchmarkMode(Mode.AverageTime) -@OutputTimeUnit(TimeUnit.NANOSECONDS) +@BenchmarkMode(Mode.SingleShotTime) +@OutputTimeUnit(TimeUnit.MINUTES) @Measurement(batchSize = 100000, iterations = 10) @Warmup(batchSize = 100000, iterations = 10) public class ArraySortBenchmark { @@ -20,27 +20,31 @@ public class ArraySortBenchmark { @State(Scope.Thread) public static class Initialize { - String[] array = new String[]{"A", "AB", "B"}; + int iterations = 1000; - List list = new ArrayList<>(); + int[] array = new int[iterations]; + + List list = new ArrayList<>(); @Setup(Level.Trial) public void setUp() { - list.add("A"); - list.add("AB"); - list.add("B"); + + for (int i = 0; i < iterations; i++) { + array[i] = i; + list.add(i); + } } } @Benchmark - public String[] benchmarkArraysSort(ArraySortBenchmark.Initialize state) { + public int[] benchmarkArraysSort(ArraySortBenchmark.Initialize state) { Arrays.sort(state.array); return state.array; } @Benchmark - public List benchmarkCollectionsSort(ArraySortBenchmark.Initialize state) { + public List benchmarkCollectionsSort(ArraySortBenchmark.Initialize state) { Collections.sort(state.list); return state.list; }