How does the diff algorithm work?

It's a classic LCS (longest common subsequence) diff that operates on lines. Identical lines stay put; added lines are flagged with +; removed lines are flagged with -.

Can I use this for large documents?

Yes, but the LCS algorithm is O(mn) in memory and time. For documents under ~5,000 lines per side it runs in milliseconds. Above that, expect some delay.

Is this like git diff?

The output is similar in spirit — same unified format (+ / -) and same line-level granularity. The algorithm is simpler (no heuristic context trimming, no --color-words mode).

Is my content uploaded?

No. Both documents are processed entirely in your browser. Neither is ever sent to a server.

Yes. Every tool on freemarkdowntools.com is free forever.

Markdown Vergelijkingstool

Vergelijk twee Markdown-documenten naast elkaar. Bekijk elke toevoeging en verwijdering.

Origineel 1 lines

Gewijzigd 1 lines

Naast elkaar Samengevoegd

+ 0 added − 0 removed = 0 unchanged

Samenvatting — Wat gratis Markdown Vergelijkingstool doet

Wat deze gratis tool is

Free Markdown Diff Tool compares two Markdown documents line-by-line using a classic LCS algorithm and shows every addition, deletion, and unchanged line. View results side-by-side for visual review o

Privacy: Deze tool draait volledig in je browser. Je tekst wordt nooit geüpload, gelogd of gecacht. Sluit het tabblad en alles is weg. Controleer in DevTools → Network: er worden geen verzoeken verzonden.

Waarom het gratis is (en hoe we het gratis houden)

Läuft im Browser.

Gebruikstabel

In één oogopslag

Invoer	Uitvoer	Typische grootte	Snelheid	Login vereist
Two Markdown documents	Line-level diff (visual + unified text)	Up to ~5,000 lines per side	< 100 ms typical	No