Timeline for How do I find the Euclidean distance between one point and all the points in a list?
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 3, 2013 at 14:18 | vote | accept | psy | ||
| Feb 3, 2013 at 2:31 | history | edited | m_goldberg | CC BY-SA 3.0 | Improved formatting |
| Feb 2, 2013 at 21:10 | history | edited | Yves Klett | CC BY-SA 3.0 | added 6 characters in body |
| Feb 2, 2013 at 21:10 | comment | added | RunnyKine | @Jens, yes you're right. In this case you don't. But suppose you want to do further analysis of a large data set, like calculate the Max or Min of the distances from each of the x1's, then the table definitely comes in handy for Memory conservation. Otherwise Mathematica will store all of those unnecessary data in memory, because Outer will have to finish before you can Map "Min" or "Max" to the entire List. | |
| Feb 2, 2013 at 21:09 | comment | added | Yves Klett | No worries whatsoever, welcome to the party! | |
| Feb 2, 2013 at 21:01 | comment | added | Jens | You don't even need the Table. Just put the entire list of x1 into Outer. | |
| Feb 2, 2013 at 21:01 | history | edited | RunnyKine | CC BY-SA 3.0 | added 12 characters in body |
| Feb 2, 2013 at 20:58 | comment | added | RunnyKine | @Yves, sorry I'm new to StackExchange, I'll try to edit it. | |
| Feb 2, 2013 at 20:41 | review | First posts | |||
| Feb 3, 2013 at 2:31 | |||||
| Feb 2, 2013 at 20:38 | comment | added | Yves Klett | Just a suggestion: formatting code inline with text makes copy&pasting less convenient compared to separate code lines. | |
| Feb 2, 2013 at 20:25 | history | answered | RunnyKine | CC BY-SA 3.0 |