Myers' algorithm is the most commonly used method for detecting changes between files/texts because of its efficiency and optimality (used by default in Git). The standard LCS algorithm has a time and space complexity of O(N*M). By contrast, Myers reduces these to O(N*D) and O(N+M) respectively. N = the first sequence's length, M = the second sequence's length, D = minimal number of edits (required to transform the first sequence into the second) Note: You can scroll through the text with the arrow keys. Also, look out for the Myers algorithm as a feature in my larger project that I will release THIS SUMMER (I was supposed to do that a year ago but I couldn't because of school lol :p)
