Explore relationships

Hamming distance

ClassString similarityData structurestringWorst-caseperformanceO(n){\displaystyle O(n)}Best-caseperformanceO(n){\displaystyle O(n)}AverageperformanceO(n){\displaystyle O(n)}Worst-casespace complexityO(n){\displaystyle O(n)}In information theory, the Hamming distance between two strings or vectors of equal length is the number of positions at which the corresponding symbols are different.

Use + to expand a branch. Click a topic name to open its summary.