Created
July 8, 2022 18:01
-
-
Save Asjas/eb72a46fec5b745c0f1e953c1b1313a6 to your computer and use it in GitHub Desktop.
Luhn Algorithm
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// https://github.com/muhammadghazali/mod10 | |
function LuhnAlgorithm(RSA_ID: string) { | |
let isValid = false; | |
let checkDigit; | |
let sumOfAllNumbers = 0; | |
let reversedIdentifier = []; | |
const identifierString = RSA_ID; | |
checkDigit = identifierString.charAt(identifierString.length - 1); | |
checkDigit = parseInt(checkDigit, 10); | |
reversedIdentifier = identifierString | |
.slice(0, identifierString.length - 1) | |
.split("") | |
.reverse(); | |
for (let i = 0; i < reversedIdentifier.length; i++) { | |
reversedIdentifier[i] = parseInt(reversedIdentifier[i], 10); | |
} | |
let index = 0; | |
let digit = 1; | |
for (; index < reversedIdentifier.length; index++, digit++) { | |
if (digit % 2 > 0) { | |
reversedIdentifier[index] *= 2; | |
} | |
if (reversedIdentifier[index] > 9) { | |
reversedIdentifier[index] -= 9; | |
} | |
sumOfAllNumbers += reversedIdentifier[index]; | |
} | |
if ((sumOfAllNumbers % 10) + checkDigit === 10) { | |
isValid = true; | |
} else { | |
isValid = false; | |
} | |
return isValid; | |
} | |
export default LuhnAlgorithm; |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment