quick Terminal bar graph comparing sorting algorithms

Author: JakubSchwenkbeck

jmh-result.csv

@@ -0,0 +1,5 @@
+"Benchmark","Mode","Threads","Samples","Score","Score Error (99.9%)","Unit"
+"benchmark.SortingBenchmark.benchmarkBubbleSort","avgt",1,5,0.125965,0.017152,"ms/op"
+"benchmark.SortingBenchmark.benchmarkCountingSort","avgt",1,5,0.004571,0.000333,"ms/op"
+"benchmark.SortingBenchmark.benchmarkHeapSort","avgt",1,5,0.074379,0.008178,"ms/op"
+"benchmark.SortingBenchmark.benchmarkInsertionSort","avgt",1,5,0.029439,0.005017,"ms/op"

src/main/scala/benchmark/PlotBenchmarks.scala

@@ -0,0 +1,30 @@
+package benchmark
+
+import scala.io.Source
+import scala.util.{Try, Using}
+
+object PlotBenchmarks {
+  def main(args: Array[String]): Unit = {
+    Using.resource(Source.fromFile("jmh-result.csv")) { source =>
+      val lines = source.getLines().toList.drop(1) // Skip header
+
+      val data = lines.flatMap { line =>
+        val cols = line.split(",").map(_.trim.replaceAll("^\"|\"$", "")) // Remove quotes
+        Try {
+          val benchmark = cols(0).split('.').last.replace("benchmark", "")
+          val score = cols(4).toDouble // Correct column index for Score
+          (benchmark, score)
+        }.toOption
+      }
+
+      val maxScore = data.map(_._2).max
+      val scale = 50 / maxScore
+
+      println("Benchmark Results (ms/op)\n" + "=" * 50)
+      data.foreach { case (algo, score) =>
+        val bar = "#" * (score * scale).toInt
+        printf("%-15s | %-50s | %.3f%n", algo, bar, score)
+      }
+    }
+  }
+}