diff --git a/template/src/Elm/Review/Vendor/Diff.elm b/template/src/Elm/Review/Vendor/Diff.elm
index 96fe6cd3d..4fed39413 100644
--- a/template/src/Elm/Review/Vendor/Diff.elm
+++ b/template/src/Elm/Review/Vendor/Diff.elm
@@ -222,39 +222,6 @@ makeChangesHelp changes getA getB ( x, y ) path =
 
 
 
--- Myers's O(ND) algorithm (http://www.xmailserver.org/diff2.pdf)
-
-
-ond : (Int -> Maybe a) -> (Int -> Maybe a) -> Int -> Int -> List ( Int, Int )
-ond getA getB m n =
-    let
-        v =
-            Array.initialize (m + n + 1) (always [])
-    in
-    ondLoopDK (snake getA getB) m 0 0 v
-
-
-ondLoopDK :
-    (Int -> Int -> List ( Int, Int ) -> ( List ( Int, Int ), Bool ))
-    -> Int
-    -> Int
-    -> Int
-    -> Array (List ( Int, Int ))
-    -> List ( Int, Int )
-ondLoopDK snake_ offset d k v =
-    if k > d then
-        ondLoopDK snake_ offset (d + 1) (-d - 1) v
-
-    else
-        case step snake_ offset k v of
-            Found path ->
-                path
-
-            Continue v_ ->
-                ondLoopDK snake_ offset d (k + 2) v_
-
-
-
 -- Wu's O(NP) algorithm (http://myerslab.mpi-cbg.de/wp-content/uploads/2014/06/np_diff.pdf)