Crthuky

This is why we puzzle

Open a doc from terminal, but not by its name

Calculate sum of polynomial roots

Store Credit Card Information in Password Manager?

Electoral considerations aside, what are potential benefits, for the US, of policy changes proposed by the tweet recognizing Golan annexation?

Why does a simple loop result in ASYNC_NETWORK_IO waits?

Why is so much work done on numerical verification of the Riemann Hypothesis?

How do you respond to a colleague from another team when they're wrongly expecting that you'll help them?

Can disgust be a key component of horror?

What are some good ways to treat frozen vegetables such that they behave like fresh vegetables when stir frying them?

Probability that THHT occurs in a sequence of 10 coin tosses

What if you are holding an Iron Flask with a demon inside and walk into Antimagic Field?

Invalid date error by date command

Why is this estimator biased?

Add big quotation marks inside my colorbox

PTIJ: Haman's bad computer

Why does AES have exactly 10 rounds for a 128-bit key, 12 for 192 bits and 14 for a 256-bit key size?

Why would a new[] expression ever invoke a destructor?

Unexpected behavior of the procedure `Area` on the object 'Polygon'

Can a stoichiometric mixture of oxygen and methane exist as a liquid at standard pressure and some (low) temperature?

Why should universal income be universal?

Is there an injective, monotonically increasing, strictly concave function from the reals, to the reals?

The IT department bottlenecks progress, how should I handle this?

Does malloc reserve more space while allocating memory?

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?

4

$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

share|improve this question

edited 32 mins ago

m_goldberg

87.7k872198

asked 1 hour ago

EdmundEdmund

26.6k330102

$endgroup$

add a comment | 

4

$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

share|improve this question

edited 32 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

share|improve this question

edited 32 mins ago

m_goldberg

87.7k872198

asked 1 hour ago

EdmundEdmund

26.6k330102

$endgroup$

SeedRandom[987]
test = RandomSample@*Join @@ Range @@@ 6, 10, 56, 60, 1, 5, -5, -1

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]]

share|improve this question

edited 32 mins ago

m_goldberg

87.7k872198

asked 1 hour ago

EdmundEdmund

26.6k330102

share|improve this question

edited 32 mins ago

m_goldberg

87.7k872198

asked 1 hour ago

EdmundEdmund

26.6k330102

edited 32 mins ago

m_goldberg

87.7k872198

edited 32 mins ago

m_goldberg

87.7k872198

asked 1 hour ago

EdmundEdmund

26.6k330102

asked 1 hour ago

EdmundEdmund

26.6k330102

1 Answer
1

active

oldest

votes

7

$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

share|improve this answer

answered 55 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
);



);

draft saved

draft discarded

Sign up or log in

StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');

var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);

;
$window.on('scroll', onScroll);

);

Sign up using Google

Sign up using Facebook

Sign up using Email and Password

Post as a guest

Name

Email

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

Name

Email

Required, but never shown

7

$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

share|improve this answer

answered 55 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 | 

7

$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

share|improve this answer

answered 55 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

share|improve this answer

answered 55 mins ago

Carl WollCarl Woll

71.2k394185

$endgroup$

Module[tmp = test,
 With[ord=Ordering[tmp],
 tmp[[ord]] = Reverse @ tmp[[ord]]];
 tmp
]

share|improve this answer

answered 55 mins ago

Carl WollCarl Woll

71.2k394185

answered 55 mins ago

Carl WollCarl Woll

71.2k394185

answered 55 mins ago

Carl WollCarl Woll

71.2k394185