Timeline for Sort lists according to the order of another
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 29, 2012 at 20:56 | comment | added | Tyson Williams | I accepted this solution since it is inline. | |
| Jun 29, 2012 at 20:56 | vote | accept | Tyson Williams | ||
| Jun 29, 2012 at 20:39 | comment | added | Rojo | Transpose is usually a very efficient operation | |
| Jun 29, 2012 at 20:38 | comment | added | Rojo | In other words, you start off with a matrix in which each ROW its one of your lists (thats lists), and you transpose it, and now your lists are the columns. Now you sort the rows of that matrix just by looking at the frist column, and transpose again | |
| Jun 29, 2012 at 20:37 | history | edited | Rojo | CC BY-SA 3.0 | deleted 16 characters in body |
| Jun 29, 2012 at 20:37 | comment | added | Rojo | @TysonWilliams \[Transpose] is a nice notation (see it in the front end) for the matrix Transpose function. You first create a single list such that it's i'th element is {list1[[i]], list2[[i]], list3[[i]]}. Then, you sort that list just by looking at its elemtents' first elements | |
| Jun 29, 2012 at 20:35 | comment | added | Tyson Williams | Why is \[Transpose] necessary? | |
| Jun 29, 2012 at 20:32 | history | answered | Rojo | CC BY-SA 3.0 |