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-jamforelseverktyg

Jamfor tva Markdown-dokument sida vid sida. Se varje tillagg och borttagning.

Original 1 lines

Ändrad 1 lines

Sida vid sida Sammanfogad

+ 0 added − 0 removed = 0 unchanged

Sammanfattning — Vad gratis Markdown-jamforelseverktyg gör

Vad detta gratis verktyg är

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

Integritet: Detta verktyg körs helt i din webbläsare. Din text laddas aldrig upp, loggas eller cachas. Stäng fliken så är den borta. Verifiera i DevTools → Network: inga förfrågningar skickas.

Varför det är gratis (och hur vi håller det gratis)

Läuft im Browser.

Användningstabell

Snabböversikt

Indata	Utdata	Typisk storlek	Hastighet	Inloggning krävs
Two Markdown documents	Line-level diff (visual + unified text)	Up to ~5,000 lines per side	< 100 ms typical	No