GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — JavaScript/String/HammingDistance.js at master · TheAlgorithms/JavaScript Expand file tree/ Copy pathHammingDistance.jsMore file actions 32 lines (27 loc) · 720 Bytes / Copy pathHammingDistance.jsFile metadata and controls32 lines (27 loc) · 720 Bytes 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 /** * Hamming Distance: https://en.wikipedia.org/wiki/Hamming_distance * * * Hamming distance is a metric for comparing two binary data strings. * * While comparing two binary strings of equal length, Hamming distance * is the number of bit positions in which the two bits are different. * The Hamming distance between two strings, a and b is denoted as d(a,b) */ /** * @param {string} a * @param {string} b * @return {number} */ export const hammingDistance = (a, b) => { if (a.length !== b.length) { throw new Error('Strings must be of the same length') } let distance = 0 for (let i = 0; i < a.length; i += 1) { if (a[i] !== b[i]) { distance += 1 } } return distance } |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |