Timeline for Retaining and reusing a one-to-one mapping from a sort
Current License: CC BY-SA 3.0
10 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Nov 11, 2023 at 19:37 | answer | added | eldo | timeline score: 1 | |
Mar 16, 2013 at 2:18 | answer | added | Mr.Wizard | timeline score: 12 | |
Feb 10, 2013 at 13:20 | vote | accept | Roger Harris | ||
Feb 8, 2013 at 15:18 | answer | added | Leonid Shifrin | timeline score: 14 | |
Feb 8, 2013 at 13:27 | history | edited | Roger Harris | CC BY-SA 3.0 |
added 593 characters in body
|
Feb 8, 2013 at 11:51 | answer | added | István Zachar | timeline score: 2 | |
Feb 8, 2013 at 11:29 | comment | added | Leonid Shifrin |
You most certainly can do this, just the ordering function would become more complex,and this can possibly degrade the efficiency. Another option is to construct a list with positions like Transpose[{lst,Range[Length[lst]]}] ,where lst is the original list, and use SortBy on this one, changing all your sorting functions as f -> First@f[#]& . Then, after a list is sorted, extract positions of elements of the original list in a sorted list as sorted[[All,2]] .
|
|
Feb 8, 2013 at 11:23 | comment | added | Roger Harris | @LeonidShifrin How can I make the "Ordering" function work for a SortBy function where we sort by column 1, then 2, etc.? | |
Feb 8, 2013 at 11:01 | comment | added | Leonid Shifrin | Yes you can. Have a look at Ordering function. | |
Feb 8, 2013 at 10:43 | history | asked | Roger Harris | CC BY-SA 3.0 |