Sort a list by elements of another list The Next CEO of Stack OverflowOrdered indices of a multiple product or sumImporting, sorting and exporting listsThe efficiency compare between Flatten[#, 1] & and Join @@ # &Lexicographic ordering of lists-of-lists?Problem with Custom Sort/Split/GatherApplying multiple functions to a single column in a tableList of (sub-)lists - query sub-lists by names?Find positions in which list elements are equalHow can I check if elements between lists are equal?comparing lists of strings
If the heap is initialized for security, then why is the stack uninitialized?
Example of a Mathematician/Physicist whose Other Publications during their PhD eclipsed their PhD Thesis
Received an invoice from my ex-employer billing me for training; how to handle?
Should I tutor a student who I know has cheated on their homework?
Contours of a clandestine nature
What is ( CFMCC ) on ILS approach chart?
What can we do to stop prior company from asking us questions?
Bold, vivid family
Complex fractions
Is micro rebar a better way to reinforce concrete than rebar?
Would this house-rule that treats advantage as a +1 to the roll instead (and disadvantage as -1) and allows them to stack be balanced?
What flight has the highest ratio of time difference to flight time?
If Nick Fury and Coulson already knew about aliens (Kree and Skrull) why did they wait until Thor's appearance to start making weapons?
Why did we only see the N-1 starfighters in one film?
How to count occurrences of text in a file?
What happened in Rome, when the western empire "fell"?
Different harmonic changes implied by a simple descending scale
Make solar eclipses exceedingly rare, but still have new moons
Why don't programming languages automatically manage the synchronous/asynchronous problem?
multiple labels for a single equation
How to make a variable always equal to the result of some calculations?
What does convergence in distribution "in the Gromov–Hausdorff" sense mean?
If/When UK leaves the EU, can a future goverment conduct a referendum to join the EU?
How to transpose the 1st and -1th levels of arbitrarily nested array?
Sort a list by elements of another list
The Next CEO of Stack OverflowOrdered indices of a multiple product or sumImporting, sorting and exporting listsThe efficiency compare between Flatten[#, 1] & and Join @@ # &Lexicographic ordering of lists-of-lists?Problem with Custom Sort/Split/GatherApplying multiple functions to a single column in a tableList of (sub-)lists - query sub-lists by names?Find positions in which list elements are equalHow can I check if elements between lists are equal?comparing lists of strings
$begingroup$
I know there are a plenty of other questions here which appear to be similar, however I did not found anything which could give me a hint.
I have two lists:
list1 = A, 12, B, 10, C, 4; (*ordered according to the second column*)
list2 = B, 5, A, 4, C, 1; (*ordered according to the second column*)
Now I want to sort list2
according to the list1
-order so the output should be:
(* A, 4, B, 5, C, 1 *)
list-manipulation sorting
$endgroup$
add a comment |
$begingroup$
I know there are a plenty of other questions here which appear to be similar, however I did not found anything which could give me a hint.
I have two lists:
list1 = A, 12, B, 10, C, 4; (*ordered according to the second column*)
list2 = B, 5, A, 4, C, 1; (*ordered according to the second column*)
Now I want to sort list2
according to the list1
-order so the output should be:
(* A, 4, B, 5, C, 1 *)
list-manipulation sorting
$endgroup$
$begingroup$
to be more specificlist2
should be sorted according to the first column oflist1
$endgroup$
– M.A.
2 days ago
1
$begingroup$
Is there a better example to show what you want? Doesn'tSort[list2]
give the desired output?
$endgroup$
– Jason B.
2 days ago
4
$begingroup$
list2[[OrderingBy[list1, -#[[2]] &]]]
in the next release...
$endgroup$
– Daniel Lichtblau
2 days ago
add a comment |
$begingroup$
I know there are a plenty of other questions here which appear to be similar, however I did not found anything which could give me a hint.
I have two lists:
list1 = A, 12, B, 10, C, 4; (*ordered according to the second column*)
list2 = B, 5, A, 4, C, 1; (*ordered according to the second column*)
Now I want to sort list2
according to the list1
-order so the output should be:
(* A, 4, B, 5, C, 1 *)
list-manipulation sorting
$endgroup$
I know there are a plenty of other questions here which appear to be similar, however I did not found anything which could give me a hint.
I have two lists:
list1 = A, 12, B, 10, C, 4; (*ordered according to the second column*)
list2 = B, 5, A, 4, C, 1; (*ordered according to the second column*)
Now I want to sort list2
according to the list1
-order so the output should be:
(* A, 4, B, 5, C, 1 *)
list-manipulation sorting
list-manipulation sorting
edited 2 days ago
MarcoB
38.1k556114
38.1k556114
asked 2 days ago
M.A.M.A.
896
896
$begingroup$
to be more specificlist2
should be sorted according to the first column oflist1
$endgroup$
– M.A.
2 days ago
1
$begingroup$
Is there a better example to show what you want? Doesn'tSort[list2]
give the desired output?
$endgroup$
– Jason B.
2 days ago
4
$begingroup$
list2[[OrderingBy[list1, -#[[2]] &]]]
in the next release...
$endgroup$
– Daniel Lichtblau
2 days ago
add a comment |
$begingroup$
to be more specificlist2
should be sorted according to the first column oflist1
$endgroup$
– M.A.
2 days ago
1
$begingroup$
Is there a better example to show what you want? Doesn'tSort[list2]
give the desired output?
$endgroup$
– Jason B.
2 days ago
4
$begingroup$
list2[[OrderingBy[list1, -#[[2]] &]]]
in the next release...
$endgroup$
– Daniel Lichtblau
2 days ago
$begingroup$
to be more specific
list2
should be sorted according to the first column of list1
$endgroup$
– M.A.
2 days ago
$begingroup$
to be more specific
list2
should be sorted according to the first column of list1
$endgroup$
– M.A.
2 days ago
1
1
$begingroup$
Is there a better example to show what you want? Doesn't
Sort[list2]
give the desired output?$endgroup$
– Jason B.
2 days ago
$begingroup$
Is there a better example to show what you want? Doesn't
Sort[list2]
give the desired output?$endgroup$
– Jason B.
2 days ago
4
4
$begingroup$
list2[[OrderingBy[list1, -#[[2]] &]]]
in the next release...$endgroup$
– Daniel Lichtblau
2 days ago
$begingroup$
list2[[OrderingBy[list1, -#[[2]] &]]]
in the next release...$endgroup$
– Daniel Lichtblau
2 days ago
add a comment |
3 Answers
3
active
oldest
votes
$begingroup$
Permute[list2, FindPermutation[ list2[[All,1]] , list1[[All,1]] ] ]
A, 4, B, 5, C, 1
$endgroup$
$begingroup$
Actually, I like your solution much better than mine. By the way, when I found out that my former solution was incorrect, I also realized that your solution should better bePermute[list2, FindPermutation[list2[[All, 1]], list1[[All, 1]]]]
.
$endgroup$
– Henrik Schumacher
2 days ago
1
$begingroup$
Doh...fixed it. Both ways give the same answer, which leads to sloppy debugging.
$endgroup$
– MikeY
2 days ago
add a comment |
$begingroup$
list1 = A, 12, B, 10, C, 4, D, 2;
list2 = A, 4, D, 11, B, 5, C, 1;
idx = Lookup[
AssociationThread[list1[[All, 1]] -> Range[Length[list1]]],
list2[[All, 1]]
];
result = list2;
result[[idx]] = list2;
result
A, 4, B, 5, C, 1, D, 11
$endgroup$
$begingroup$
works well with the example lists. However, something goes wrong when I use other lists with Strings in the first columns instead ofA
,B
andC
....
$endgroup$
– M.A.
2 days ago
add a comment |
$begingroup$
ugly but fast:
list2[[Ordering[list2[[All, 1]]][[Ordering[Ordering[list1[[All, 1]]]]]]]]
A, 4, B, 5, C, 1
even faster:
result = list2;
result[[Ordering[list1[[All, 1]]]]] = SortBy[list2, First];
result
A, 4, B, 5, C, 1
benchmarks
s = 10^7;
list1 = Transpose[PermutationList@RandomPermutation[s],
RandomInteger[0, 10, s]];
list2 = Transpose[PermutationList@RandomPermutation[s],
RandomInteger[0, 10, s]];
(* my first solution *)
result1 = list2[[Ordering[list2[[All, 1]]][[Ordering[Ordering[list1[[All, 1]]]]]]]]; //AbsoluteTiming//First
(* 8.6416 *)
(* my second solution *)
result2 = Module[L,
L = list2;
L[[Ordering[list1[[All, 1]]]]] = SortBy[list2, First];
L]; //AbsoluteTiming//First
(* 6.89593 *)
(* MikeY's solution *)
result3 = Permute[list2, FindPermutation[list2[[All, 1]], list1[[All, 1]]]]; //AbsoluteTiming//First
(* 15.808 *)
(* Henrik Schumacher's solution *)
result4 = Module[idx, L,
idx = Lookup[AssociationThread[list1[[All, 1]] -> Range[Length[list1]]], list2[[All, 1]]];
L = list2;
L[[idx]] = list2;
L]; //AbsoluteTiming//First
(* 31.7412 *)
(* make sure all methods agree *)
result1 == result2 == result3 == result4
(* True *)
$endgroup$
$begingroup$
Thanks for the benchmark. I started down theOrdering
road, but went for parsimony of expression. Mild bummer that it is at least twice as slow as the best method.
$endgroup$
– MikeY
2 days ago
add a comment |
Your Answer
StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
);
);
, "mathjax-editing");
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "387"
;
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: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
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%2fmathematica.stackexchange.com%2fquestions%2f194061%2fsort-a-list-by-elements-of-another-list%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
3 Answers
3
active
oldest
votes
3 Answers
3
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Permute[list2, FindPermutation[ list2[[All,1]] , list1[[All,1]] ] ]
A, 4, B, 5, C, 1
$endgroup$
$begingroup$
Actually, I like your solution much better than mine. By the way, when I found out that my former solution was incorrect, I also realized that your solution should better bePermute[list2, FindPermutation[list2[[All, 1]], list1[[All, 1]]]]
.
$endgroup$
– Henrik Schumacher
2 days ago
1
$begingroup$
Doh...fixed it. Both ways give the same answer, which leads to sloppy debugging.
$endgroup$
– MikeY
2 days ago
add a comment |
$begingroup$
Permute[list2, FindPermutation[ list2[[All,1]] , list1[[All,1]] ] ]
A, 4, B, 5, C, 1
$endgroup$
$begingroup$
Actually, I like your solution much better than mine. By the way, when I found out that my former solution was incorrect, I also realized that your solution should better bePermute[list2, FindPermutation[list2[[All, 1]], list1[[All, 1]]]]
.
$endgroup$
– Henrik Schumacher
2 days ago
1
$begingroup$
Doh...fixed it. Both ways give the same answer, which leads to sloppy debugging.
$endgroup$
– MikeY
2 days ago
add a comment |
$begingroup$
Permute[list2, FindPermutation[ list2[[All,1]] , list1[[All,1]] ] ]
A, 4, B, 5, C, 1
$endgroup$
Permute[list2, FindPermutation[ list2[[All,1]] , list1[[All,1]] ] ]
A, 4, B, 5, C, 1
edited 2 days ago
answered 2 days ago
MikeYMikeY
3,553714
3,553714
$begingroup$
Actually, I like your solution much better than mine. By the way, when I found out that my former solution was incorrect, I also realized that your solution should better bePermute[list2, FindPermutation[list2[[All, 1]], list1[[All, 1]]]]
.
$endgroup$
– Henrik Schumacher
2 days ago
1
$begingroup$
Doh...fixed it. Both ways give the same answer, which leads to sloppy debugging.
$endgroup$
– MikeY
2 days ago
add a comment |
$begingroup$
Actually, I like your solution much better than mine. By the way, when I found out that my former solution was incorrect, I also realized that your solution should better bePermute[list2, FindPermutation[list2[[All, 1]], list1[[All, 1]]]]
.
$endgroup$
– Henrik Schumacher
2 days ago
1
$begingroup$
Doh...fixed it. Both ways give the same answer, which leads to sloppy debugging.
$endgroup$
– MikeY
2 days ago
$begingroup$
Actually, I like your solution much better than mine. By the way, when I found out that my former solution was incorrect, I also realized that your solution should better be
Permute[list2, FindPermutation[list2[[All, 1]], list1[[All, 1]]]]
.$endgroup$
– Henrik Schumacher
2 days ago
$begingroup$
Actually, I like your solution much better than mine. By the way, when I found out that my former solution was incorrect, I also realized that your solution should better be
Permute[list2, FindPermutation[list2[[All, 1]], list1[[All, 1]]]]
.$endgroup$
– Henrik Schumacher
2 days ago
1
1
$begingroup$
Doh...fixed it. Both ways give the same answer, which leads to sloppy debugging.
$endgroup$
– MikeY
2 days ago
$begingroup$
Doh...fixed it. Both ways give the same answer, which leads to sloppy debugging.
$endgroup$
– MikeY
2 days ago
add a comment |
$begingroup$
list1 = A, 12, B, 10, C, 4, D, 2;
list2 = A, 4, D, 11, B, 5, C, 1;
idx = Lookup[
AssociationThread[list1[[All, 1]] -> Range[Length[list1]]],
list2[[All, 1]]
];
result = list2;
result[[idx]] = list2;
result
A, 4, B, 5, C, 1, D, 11
$endgroup$
$begingroup$
works well with the example lists. However, something goes wrong when I use other lists with Strings in the first columns instead ofA
,B
andC
....
$endgroup$
– M.A.
2 days ago
add a comment |
$begingroup$
list1 = A, 12, B, 10, C, 4, D, 2;
list2 = A, 4, D, 11, B, 5, C, 1;
idx = Lookup[
AssociationThread[list1[[All, 1]] -> Range[Length[list1]]],
list2[[All, 1]]
];
result = list2;
result[[idx]] = list2;
result
A, 4, B, 5, C, 1, D, 11
$endgroup$
$begingroup$
works well with the example lists. However, something goes wrong when I use other lists with Strings in the first columns instead ofA
,B
andC
....
$endgroup$
– M.A.
2 days ago
add a comment |
$begingroup$
list1 = A, 12, B, 10, C, 4, D, 2;
list2 = A, 4, D, 11, B, 5, C, 1;
idx = Lookup[
AssociationThread[list1[[All, 1]] -> Range[Length[list1]]],
list2[[All, 1]]
];
result = list2;
result[[idx]] = list2;
result
A, 4, B, 5, C, 1, D, 11
$endgroup$
list1 = A, 12, B, 10, C, 4, D, 2;
list2 = A, 4, D, 11, B, 5, C, 1;
idx = Lookup[
AssociationThread[list1[[All, 1]] -> Range[Length[list1]]],
list2[[All, 1]]
];
result = list2;
result[[idx]] = list2;
result
A, 4, B, 5, C, 1, D, 11
edited 2 days ago
answered 2 days ago
Henrik SchumacherHenrik Schumacher
58.4k581161
58.4k581161
$begingroup$
works well with the example lists. However, something goes wrong when I use other lists with Strings in the first columns instead ofA
,B
andC
....
$endgroup$
– M.A.
2 days ago
add a comment |
$begingroup$
works well with the example lists. However, something goes wrong when I use other lists with Strings in the first columns instead ofA
,B
andC
....
$endgroup$
– M.A.
2 days ago
$begingroup$
works well with the example lists. However, something goes wrong when I use other lists with Strings in the first columns instead of
A
, B
and C
....$endgroup$
– M.A.
2 days ago
$begingroup$
works well with the example lists. However, something goes wrong when I use other lists with Strings in the first columns instead of
A
, B
and C
....$endgroup$
– M.A.
2 days ago
add a comment |
$begingroup$
ugly but fast:
list2[[Ordering[list2[[All, 1]]][[Ordering[Ordering[list1[[All, 1]]]]]]]]
A, 4, B, 5, C, 1
even faster:
result = list2;
result[[Ordering[list1[[All, 1]]]]] = SortBy[list2, First];
result
A, 4, B, 5, C, 1
benchmarks
s = 10^7;
list1 = Transpose[PermutationList@RandomPermutation[s],
RandomInteger[0, 10, s]];
list2 = Transpose[PermutationList@RandomPermutation[s],
RandomInteger[0, 10, s]];
(* my first solution *)
result1 = list2[[Ordering[list2[[All, 1]]][[Ordering[Ordering[list1[[All, 1]]]]]]]]; //AbsoluteTiming//First
(* 8.6416 *)
(* my second solution *)
result2 = Module[L,
L = list2;
L[[Ordering[list1[[All, 1]]]]] = SortBy[list2, First];
L]; //AbsoluteTiming//First
(* 6.89593 *)
(* MikeY's solution *)
result3 = Permute[list2, FindPermutation[list2[[All, 1]], list1[[All, 1]]]]; //AbsoluteTiming//First
(* 15.808 *)
(* Henrik Schumacher's solution *)
result4 = Module[idx, L,
idx = Lookup[AssociationThread[list1[[All, 1]] -> Range[Length[list1]]], list2[[All, 1]]];
L = list2;
L[[idx]] = list2;
L]; //AbsoluteTiming//First
(* 31.7412 *)
(* make sure all methods agree *)
result1 == result2 == result3 == result4
(* True *)
$endgroup$
$begingroup$
Thanks for the benchmark. I started down theOrdering
road, but went for parsimony of expression. Mild bummer that it is at least twice as slow as the best method.
$endgroup$
– MikeY
2 days ago
add a comment |
$begingroup$
ugly but fast:
list2[[Ordering[list2[[All, 1]]][[Ordering[Ordering[list1[[All, 1]]]]]]]]
A, 4, B, 5, C, 1
even faster:
result = list2;
result[[Ordering[list1[[All, 1]]]]] = SortBy[list2, First];
result
A, 4, B, 5, C, 1
benchmarks
s = 10^7;
list1 = Transpose[PermutationList@RandomPermutation[s],
RandomInteger[0, 10, s]];
list2 = Transpose[PermutationList@RandomPermutation[s],
RandomInteger[0, 10, s]];
(* my first solution *)
result1 = list2[[Ordering[list2[[All, 1]]][[Ordering[Ordering[list1[[All, 1]]]]]]]]; //AbsoluteTiming//First
(* 8.6416 *)
(* my second solution *)
result2 = Module[L,
L = list2;
L[[Ordering[list1[[All, 1]]]]] = SortBy[list2, First];
L]; //AbsoluteTiming//First
(* 6.89593 *)
(* MikeY's solution *)
result3 = Permute[list2, FindPermutation[list2[[All, 1]], list1[[All, 1]]]]; //AbsoluteTiming//First
(* 15.808 *)
(* Henrik Schumacher's solution *)
result4 = Module[idx, L,
idx = Lookup[AssociationThread[list1[[All, 1]] -> Range[Length[list1]]], list2[[All, 1]]];
L = list2;
L[[idx]] = list2;
L]; //AbsoluteTiming//First
(* 31.7412 *)
(* make sure all methods agree *)
result1 == result2 == result3 == result4
(* True *)
$endgroup$
$begingroup$
Thanks for the benchmark. I started down theOrdering
road, but went for parsimony of expression. Mild bummer that it is at least twice as slow as the best method.
$endgroup$
– MikeY
2 days ago
add a comment |
$begingroup$
ugly but fast:
list2[[Ordering[list2[[All, 1]]][[Ordering[Ordering[list1[[All, 1]]]]]]]]
A, 4, B, 5, C, 1
even faster:
result = list2;
result[[Ordering[list1[[All, 1]]]]] = SortBy[list2, First];
result
A, 4, B, 5, C, 1
benchmarks
s = 10^7;
list1 = Transpose[PermutationList@RandomPermutation[s],
RandomInteger[0, 10, s]];
list2 = Transpose[PermutationList@RandomPermutation[s],
RandomInteger[0, 10, s]];
(* my first solution *)
result1 = list2[[Ordering[list2[[All, 1]]][[Ordering[Ordering[list1[[All, 1]]]]]]]]; //AbsoluteTiming//First
(* 8.6416 *)
(* my second solution *)
result2 = Module[L,
L = list2;
L[[Ordering[list1[[All, 1]]]]] = SortBy[list2, First];
L]; //AbsoluteTiming//First
(* 6.89593 *)
(* MikeY's solution *)
result3 = Permute[list2, FindPermutation[list2[[All, 1]], list1[[All, 1]]]]; //AbsoluteTiming//First
(* 15.808 *)
(* Henrik Schumacher's solution *)
result4 = Module[idx, L,
idx = Lookup[AssociationThread[list1[[All, 1]] -> Range[Length[list1]]], list2[[All, 1]]];
L = list2;
L[[idx]] = list2;
L]; //AbsoluteTiming//First
(* 31.7412 *)
(* make sure all methods agree *)
result1 == result2 == result3 == result4
(* True *)
$endgroup$
ugly but fast:
list2[[Ordering[list2[[All, 1]]][[Ordering[Ordering[list1[[All, 1]]]]]]]]
A, 4, B, 5, C, 1
even faster:
result = list2;
result[[Ordering[list1[[All, 1]]]]] = SortBy[list2, First];
result
A, 4, B, 5, C, 1
benchmarks
s = 10^7;
list1 = Transpose[PermutationList@RandomPermutation[s],
RandomInteger[0, 10, s]];
list2 = Transpose[PermutationList@RandomPermutation[s],
RandomInteger[0, 10, s]];
(* my first solution *)
result1 = list2[[Ordering[list2[[All, 1]]][[Ordering[Ordering[list1[[All, 1]]]]]]]]; //AbsoluteTiming//First
(* 8.6416 *)
(* my second solution *)
result2 = Module[L,
L = list2;
L[[Ordering[list1[[All, 1]]]]] = SortBy[list2, First];
L]; //AbsoluteTiming//First
(* 6.89593 *)
(* MikeY's solution *)
result3 = Permute[list2, FindPermutation[list2[[All, 1]], list1[[All, 1]]]]; //AbsoluteTiming//First
(* 15.808 *)
(* Henrik Schumacher's solution *)
result4 = Module[idx, L,
idx = Lookup[AssociationThread[list1[[All, 1]] -> Range[Length[list1]]], list2[[All, 1]]];
L = list2;
L[[idx]] = list2;
L]; //AbsoluteTiming//First
(* 31.7412 *)
(* make sure all methods agree *)
result1 == result2 == result3 == result4
(* True *)
edited yesterday
answered 2 days ago
RomanRoman
3,9661022
3,9661022
$begingroup$
Thanks for the benchmark. I started down theOrdering
road, but went for parsimony of expression. Mild bummer that it is at least twice as slow as the best method.
$endgroup$
– MikeY
2 days ago
add a comment |
$begingroup$
Thanks for the benchmark. I started down theOrdering
road, but went for parsimony of expression. Mild bummer that it is at least twice as slow as the best method.
$endgroup$
– MikeY
2 days ago
$begingroup$
Thanks for the benchmark. I started down the
Ordering
road, but went for parsimony of expression. Mild bummer that it is at least twice as slow as the best method.$endgroup$
– MikeY
2 days ago
$begingroup$
Thanks for the benchmark. I started down the
Ordering
road, but went for parsimony of expression. Mild bummer that it is at least twice as slow as the best method.$endgroup$
– MikeY
2 days ago
add a comment |
Thanks for contributing an answer to Mathematica Stack Exchange!
- 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.
Use MathJax to format equations. MathJax reference.
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%2fmathematica.stackexchange.com%2fquestions%2f194061%2fsort-a-list-by-elements-of-another-list%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
$begingroup$
to be more specific
list2
should be sorted according to the first column oflist1
$endgroup$
– M.A.
2 days ago
1
$begingroup$
Is there a better example to show what you want? Doesn't
Sort[list2]
give the desired output?$endgroup$
– Jason B.
2 days ago
4
$begingroup$
list2[[OrderingBy[list1, -#[[2]] &]]]
in the next release...$endgroup$
– Daniel Lichtblau
2 days ago