In computer science, the Hunt–Szymanski algorithm, also known as Hunt–McIlroy algorithm, is a solution to the longest common subsequence problem. It was one of the first non-heuristic algorithms used in diff, which compares a pair of files, each represented as a sequence of lines.
In computer science, the Hunt–Szymanski algorithm, also known as Hunt–McIlroy algorithm, is a solution to the longest common subsequence problem. It was one of the first non-heuristic algorithms used in diff, which compares a pair of files, each represented as a sequence of lines.
Source: Wikipedia "Hunt–Szymanski algorithm" · CC BY-SA 4.0
Share this article: X · Bluesky