Timeline for Finding all elements within a certain range in a sorted list
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 27, 2012 at 11:25 | history | edited | faleichik | CC BY-SA 3.0 | added 27 characters in body |
| Feb 27, 2012 at 10:13 | comment | added | Szabolcs | I was always curious about how Nearest worked, and I don't know much about data structures, so I finally asked on SO. | |
| Feb 27, 2012 at 9:56 | comment | added | faleichik | It is documented here: reference.wolfram.com/mathematica/tutorial/UsingNearest.html | |
| Feb 27, 2012 at 9:50 | comment | added | Szabolcs | I did not know about this syntax of a NearestFunction (i.e. an argument of the form {\[Infinity], dx}). It is not documented on the doc page for Nearest. Your answer shows that it was definitely worth asking this question. I do wonder how Nearest works though. It works on two-dimensional data as well, so I doubt it does a plain sort internally. | |
| Feb 27, 2012 at 9:36 | history | answered | faleichik | CC BY-SA 3.0 |