Hash Algorithm Numbering
I am trying to come up with a hash algorithm to number random numbers and alphabets from 1 to 100. The random codes must have Alphabet as the first three followed by four numeric digits (ex. ABC1234).
So far I have attempted to number them by converting alphabets into numbers by their alphabetical order, adding them, dividing them by 10 and set its remainders to be the second digit of the numbering while the last digit would be the same but with the numeric digits.
However, I couldn't figure out how to reach 100 and how to test this algorithm.
hash
asked Nov 23 '18 at 9:33
Titor
62
add a comment |
I am trying to come up with a hash algorithm to number random numbers and alphabets from 1 to 100. The random codes must have Alphabet as the first three followed by four numeric digits (ex. ABC1234).
So far I have attempted to number them by converting alphabets into numbers by their alphabetical order, adding them, dividing them by 10 and set its remainders to be the second digit of the numbering while the last digit would be the same but with the numeric digits.
However, I couldn't figure out how to reach 100 and how to test this algorithm.
hash
asked Nov 23 '18 at 9:33
Titor
62
add a comment |
I am trying to come up with a hash algorithm to number random numbers and alphabets from 1 to 100. The random codes must have Alphabet as the first three followed by four numeric digits (ex. ABC1234).
So far I have attempted to number them by converting alphabets into numbers by their alphabetical order, adding them, dividing them by 10 and set its remainders to be the second digit of the numbering while the last digit would be the same but with the numeric digits.
However, I couldn't figure out how to reach 100 and how to test this algorithm.
hash
asked Nov 23 '18 at 9:33
Titor
62
I am trying to come up with a hash algorithm to number random numbers and alphabets from 1 to 100. The random codes must have Alphabet as the first three followed by four numeric digits (ex. ABC1234).
So far I have attempted to number them by converting alphabets into numbers by their alphabetical order, adding them, dividing them by 10 and set its remainders to be the second digit of the numbering while the last digit would be the same but with the numeric digits.
However, I couldn't figure out how to reach 100 and how to test this algorithm.
hash
hash
asked Nov 23 '18 at 9:33
Titor
62
asked Nov 23 '18 at 9:33
Titor
62
edited Nov 23 '18 at 10:24
asked Nov 23 '18 at 9:33
Titor
62
asked Nov 23 '18 at 9:33
Titor
62
asked Nov 23 '18 at 9:33
Titor
62
62
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53443964%2fhash-algorithm-numbering%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Stack Overflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53443964%2fhash-algorithm-numbering%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
