Efficent algorithm to compute the N highest scoring permutations from x sorted vectors
I am searching for an efficient algorithm, which is able to compute N distinct highest value combinations from x sorted vectors.
Each vector should contribute a single value to the permutation.
Here is an example with three vecotors:
[11, 9, 5]
[10, 9, 8, 5]
[12, 7, 5, 3, -1]
E.g. the algorithm should return the following values if N is chosen to be 3
11,10,12
11,9,12
11,8,12
algorithm permutation
asked Jan 20 at 14:05
martin smartin s
5741925
add a comment |
I am searching for an efficient algorithm, which is able to compute N distinct highest value combinations from x sorted vectors.
Each vector should contribute a single value to the permutation.
Here is an example with three vecotors:
[11, 9, 5]
[10, 9, 8, 5]
[12, 7, 5, 3, -1]
E.g. the algorithm should return the following values if N is chosen to be 3
11,10,12
11,9,12
11,8,12
algorithm permutation
asked Jan 20 at 14:05
martin smartin s
5741925
add a comment |
I am searching for an efficient algorithm, which is able to compute N distinct highest value combinations from x sorted vectors.
Each vector should contribute a single value to the permutation.
Here is an example with three vecotors:
[11, 9, 5]
[10, 9, 8, 5]
[12, 7, 5, 3, -1]
E.g. the algorithm should return the following values if N is chosen to be 3
11,10,12
11,9,12
11,8,12
algorithm permutation
asked Jan 20 at 14:05
martin smartin s
5741925
I am searching for an efficient algorithm, which is able to compute N distinct highest value combinations from x sorted vectors.
Each vector should contribute a single value to the permutation.
Here is an example with three vecotors:
[11, 9, 5]
[10, 9, 8, 5]
[12, 7, 5, 3, -1]
E.g. the algorithm should return the following values if N is chosen to be 3
11,10,12
11,9,12
11,8,12
algorithm permutation
algorithm permutation
asked Jan 20 at 14:05
martin smartin s
5741925
asked Jan 20 at 14:05
martin smartin s
5741925
asked Jan 20 at 14:05
martin smartin s
5741925
asked Jan 20 at 14:05
martin smartin s
5741925
asked Jan 20 at 14:05
martin smartin s
5741925
5741925
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%2f54277253%2fefficent-algorithm-to-compute-the-n-highest-scoring-permutations-from-x-sorted-v%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.
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%2f54277253%2fefficent-algorithm-to-compute-the-n-highest-scoring-permutations-from-x-sorted-v%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
