Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re^3: Sort over remaining part of array

by jethro (Monsignor)
on Nov 12, 2013 at 14:23 UTC ( #1062201=note: print w/replies, xml ) Need Help??


in reply to Re^2: Sort over remaining part of array
in thread Sort over remaining part of array

You re-sort the part of the array starting at $a after resampling $a. What if $a is higher after resampling? It would have to be inserted somewhere before the part you want to re-sort. Instead of sorting the complete array just because one element changes you could just find out where the resampled element has to go and use splice to extract and insert it at the new place

Even better: Don't sort at all, resample until all $b's are unique and then do just one sort.

  • Comment on Re^3: Sort over remaining part of array

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1062201]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others meditating upon the Monastery: (4)
As of 2020-06-03 22:17 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Do you really want to know if there is extraterrestrial life?



    Results (29 votes). Check out past polls.

    Notices?