implemented the EditDistance dynamic program

Author: JakubSchwenkbeck

src/main/scala/algorithms/dynamic/EditDistance.scala

@@ -1 +1,35 @@
 package algorithms.dynamic
+
+/// Edit Distance Algorithm (Levenshtein Distance)
+/// Computes the minimum number of operations (insertions, deletions, and substitutions)
+/// required to convert one string into another.
+///
+/// Time Complexity: O(m * n), where m and n are the lengths of the input strings.
+def editDistance(X: Array[Char], Y: Array[Char]): (Array[Array[Int]], Int) = {
+
+  val n: Int = Y.length
+  val m: Int = X.length
+
+  val Edit: Array[Array[Int]] = Array.fill(m, n)(0)
+
+  for (i <- 0 until n - 1) {
+    Edit(0)(i) = i
+  }
+  for (i <- 0 until m - 1) {
+    Edit(i)(0) = i
+
+    for (j <- 0 until n - 1) {
+      val ins: Int = Edit(i)(j - 1) + 1
+      val del: Int = Edit(i - 1)(j) + 1
+      var rep: Int = Int.MaxValue
+      if (X(i) == Y(j)) {
+        rep = Edit(i - 1)(j - 1)
+      } else {
+        rep = Edit(i - 1)(j - 1) + 1
+      }
+      Edit(i)(j) = Math.min(ins, Math.min(del, rep))
+    }
+
+  }
+  (Edit, Edit(m - 1)(n - 1))
+}

src/main/scala/benchmark/SortingBenchmark.scala

@@ -6,6 +6,8 @@ import org.openjdk.jmh.annotations._
 import java.util.concurrent.TimeUnit
 import scala.util.Random
 
+// COMMAND : sbt "jmh:run -i 5 -wi 2 -f1 -t1 -rf csv"
+
 @BenchmarkMode(Array(Mode.AverageTime))
 @OutputTimeUnit(TimeUnit.MILLISECONDS)
 @State(Scope.Thread)