Terse Method to Swap Lowest for Highest?Efficient method for Inserting arrays into arraysSwap elements in list without copyBetter method to swap the values of two 2-D arraysHow to get this list with a terse methodBuilt-in (or Terse) Method to Combine and Transpose DatasetsAre there more readable and terse method can get this listefficiently method for generating a sequenceSimple method to sort versionsFunction for SortBySwap Elements of a continuous List, possible?
Why "had" in "[something] we would have made had we used [something]"?
Unexpected behavior of the procedure `Area` on the object 'Polygon'
Does malloc reserve more space while allocating memory?
User Story breakdown - Technical Task + User Feature
How to explain what's wrong with this application of the chain rule?
Limits and Infinite Integration by Parts
Probability that THHT occurs in a sequence of 10 coin tosses
Has any country ever had 2 former presidents in jail simultaneously?
What if you are holding an Iron Flask with a demon inside and walk into Antimagic Field?
How to cover method return statement in Apex Class?
Do the primes contain an infinite almost arithmetic progression?
Does the UK parliament need to pass secondary legislation to accept the Article 50 extension
Did arcade monitors have same pixel aspect ratio as TV sets?
Strong empirical falsification of quantum mechanics based on vacuum energy density?
Is there a RAID 0 Equivalent for RAM?
Does an advisor owe his/her student anything? Will an advisor keep a PhD student only out of pity?
Does the Linux kernel need a file system to run?
Why is short-wave infrared portion of electromagnetic spectrum so sensitive to fire?
Biological Blimps: Propulsion
PTIJ: Haman's bad computer
Can I say "fingers" when referring to toes?
Why does the Sun have different day lengths, but not the gas giants?
Can disgust be a key component of horror?
Mimic lecturing on blackboard, facing audience
Terse Method to Swap Lowest for Highest?
Efficient method for Inserting arrays into arraysSwap elements in list without copyBetter method to swap the values of two 2-D arraysHow to get this list with a terse methodBuilt-in (or Terse) Method to Combine and Transpose DatasetsAre there more readable and terse method can get this listefficiently method for generating a sequenceSimple method to sort versionsFunction for SortBySwap Elements of a continuous List, possible?
$begingroup$
I have built a solution to swap the lowest values with the highest values in a list.
With
SeedRandom[987]
test = RandomSample@*Join @@ Range @@@ 6, 10, 56, 60, 1, 5, -5, -1
-1, 2, 7, 8, 60, 57, 58, 10, 9, 4, -5, -3, 3, 59, 1, 5, -4, 6, -2, 56
Then
swapPositions =
PermutationReplace[
Ordering@Ordering@test,
With[len = Length@test,
Cycles@
Transpose@Range @@ 1, Floor[len/2], Reverse@*Range @@ Ceiling[len/2] + 1, len
]
];
Sort[test][[swapPositions]]
56, 9, 4, 3, -5, -2, -3, 1, 2, 7, 60, 58, 8, -4, 10, 6, 59, 5, 57, -1
The largest half of the numbers have had their positions swapped with lowest half of the numbers.
However, it feels too verbose and I think Sort might be expensive in this case. Is there a built-in function or more terse method to achieve this. Of course with no loss in speed. The actual case is for list of length 100000 and more.
list-manipulation performance-tuning sorting
edited 31 mins ago
m_goldberg
87.7k872198
asked 1 hour ago
EdmundEdmund
26.6k330102
$endgroup$
add a comment |
$begingroup$
I have built a solution to swap the lowest values with the highest values in a list.
With
SeedRandom[987]
test = RandomSample@*Join @@ Range @@@ 6, 10, 56, 60, 1, 5, -5, -1
-1, 2, 7, 8, 60, 57, 58, 10, 9, 4, -5, -3, 3, 59, 1, 5, -4, 6, -2, 56
Then
swapPositions =
PermutationReplace[
Ordering@Ordering@test,
With[len = Length@test,
Cycles@
Transpose@Range @@ 1, Floor[len/2], Reverse@*Range @@ Ceiling[len/2] + 1, len
]
];
Sort[test][[swapPositions]]
56, 9, 4, 3, -5, -2, -3, 1, 2, 7, 60, 58, 8, -4, 10, 6, 59, 5, 57, -1
The largest half of the numbers have had their positions swapped with lowest half of the numbers.
However, it feels too verbose and I think Sort might be expensive in this case. Is there a built-in function or more terse method to achieve this. Of course with no loss in speed. The actual case is for list of length 100000 and more.
list-manipulation performance-tuning sorting
edited 31 mins ago
m_goldberg
87.7k872198
asked 1 hour ago
EdmundEdmund
26.6k330102
$endgroup$
add a comment |
$begingroup$
I have built a solution to swap the lowest values with the highest values in a list.
With
SeedRandom[987]
test = RandomSample@*Join @@ Range @@@ 6, 10, 56, 60, 1, 5, -5, -1
-1, 2, 7, 8, 60, 57, 58, 10, 9, 4, -5, -3, 3, 59, 1, 5, -4, 6, -2, 56
Then
swapPositions =
PermutationReplace[
Ordering@Ordering@test,
With[len = Length@test,
Cycles@
Transpose@Range @@ 1, Floor[len/2], Reverse@*Range @@ Ceiling[len/2] + 1, len
]
];
Sort[test][[swapPositions]]
56, 9, 4, 3, -5, -2, -3, 1, 2, 7, 60, 58, 8, -4, 10, 6, 59, 5, 57, -1
The largest half of the numbers have had their positions swapped with lowest half of the numbers.
However, it feels too verbose and I think Sort might be expensive in this case. Is there a built-in function or more terse method to achieve this. Of course with no loss in speed. The actual case is for list of length 100000 and more.
list-manipulation performance-tuning sorting
edited 31 mins ago
m_goldberg
87.7k872198
asked 1 hour ago
EdmundEdmund
26.6k330102
$endgroup$
I have built a solution to swap the lowest values with the highest values in a list.
With
SeedRandom[987]
test = RandomSample@*Join @@ Range @@@ 6, 10, 56, 60, 1, 5, -5, -1
-1, 2, 7, 8, 60, 57, 58, 10, 9, 4, -5, -3, 3, 59, 1, 5, -4, 6, -2, 56
Then
swapPositions =
PermutationReplace[
Ordering@Ordering@test,
With[len = Length@test,
Cycles@
Transpose@Range @@ 1, Floor[len/2], Reverse@*Range @@ Ceiling[len/2] + 1, len
]
];
Sort[test][[swapPositions]]
56, 9, 4, 3, -5, -2, -3, 1, 2, 7, 60, 58, 8, -4, 10, 6, 59, 5, 57, -1
The largest half of the numbers have had their positions swapped with lowest half of the numbers.
However, it feels too verbose and I think Sort might be expensive in this case. Is there a built-in function or more terse method to achieve this. Of course with no loss in speed. The actual case is for list of length 100000 and more.
list-manipulation performance-tuning sorting
list-manipulation performance-tuning sorting
edited 31 mins ago
m_goldberg
87.7k872198
asked 1 hour ago
EdmundEdmund
26.6k330102
edited 31 mins ago
m_goldberg
87.7k872198
asked 1 hour ago
EdmundEdmund
26.6k330102
edited 31 mins ago
m_goldberg
87.7k872198
edited 31 mins ago
m_goldberg
87.7k872198
edited 31 mins ago
m_goldberg
87.7k872198
87.7k872198
asked 1 hour ago
EdmundEdmund
26.6k330102
asked 1 hour ago
EdmundEdmund
26.6k330102
asked 1 hour ago
EdmundEdmund
26.6k330102
26.6k330102
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
How about:
Module[tmp = test,
With[ord=Ordering[tmp],
tmp[[ord]] = Reverse @ tmp[[ord]]];
tmp
]
56, 9, 4, 3, -5, -2, -3, 1, 2, 7, 60, 58, 8, -4, 10, 6, 59, 5, 57, -1
answered 54 mins ago
Carl WollCarl Woll
71.2k394185
$endgroup$
$begingroup$
That is so obvious I want to cry. Thanks (+1).
$endgroup$
– Edmund
50 mins 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%2f193790%2fterse-method-to-swap-lowest-for-highest%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
How about:
Module[tmp = test,
With[ord=Ordering[tmp],
tmp[[ord]] = Reverse @ tmp[[ord]]];
tmp
]
56, 9, 4, 3, -5, -2, -3, 1, 2, 7, 60, 58, 8, -4, 10, 6, 59, 5, 57, -1
answered 54 mins ago
Carl WollCarl Woll
71.2k394185
$endgroup$
$begingroup$
That is so obvious I want to cry. Thanks (+1).
$endgroup$
– Edmund
50 mins ago
add a comment |
$begingroup$
How about:
Module[tmp = test,
With[ord=Ordering[tmp],
tmp[[ord]] = Reverse @ tmp[[ord]]];
tmp
]
56, 9, 4, 3, -5, -2, -3, 1, 2, 7, 60, 58, 8, -4, 10, 6, 59, 5, 57, -1
answered 54 mins ago
Carl WollCarl Woll
71.2k394185
$endgroup$
$begingroup$
That is so obvious I want to cry. Thanks (+1).
$endgroup$
– Edmund
50 mins ago
add a comment |
$begingroup$
How about:
Module[tmp = test,
With[ord=Ordering[tmp],
tmp[[ord]] = Reverse @ tmp[[ord]]];
tmp
]
56, 9, 4, 3, -5, -2, -3, 1, 2, 7, 60, 58, 8, -4, 10, 6, 59, 5, 57, -1
answered 54 mins ago
Carl WollCarl Woll
71.2k394185
$endgroup$
How about:
Module[tmp = test,
With[ord=Ordering[tmp],
tmp[[ord]] = Reverse @ tmp[[ord]]];
tmp
]
56, 9, 4, 3, -5, -2, -3, 1, 2, 7, 60, 58, 8, -4, 10, 6, 59, 5, 57, -1
answered 54 mins ago
Carl WollCarl Woll
71.2k394185
answered 54 mins ago
Carl WollCarl Woll
71.2k394185
answered 54 mins ago
Carl WollCarl Woll
71.2k394185
answered 54 mins ago
Carl WollCarl Woll
71.2k394185
71.2k394185
$begingroup$
That is so obvious I want to cry. Thanks (+1).
$endgroup$
– Edmund
50 mins ago
add a comment |
$begingroup$
That is so obvious I want to cry. Thanks (+1).
$endgroup$
– Edmund
50 mins ago
$begingroup$
That is so obvious I want to cry. Thanks (+1).
$endgroup$
– Edmund
50 mins ago
$begingroup$
That is so obvious I want to cry. Thanks (+1).
$endgroup$
– Edmund
50 mins 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%2f193790%2fterse-method-to-swap-lowest-for-highest%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
