Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.ruby > #4548
| From | Martin DeMello <martindemello@gmail.com> |
|---|---|
| Newsgroups | comp.lang.ruby |
| Subject | Re: search nearest to elements in array (hash) |
| Date | 2011-05-14 16:30 -0500 |
| Organization | Service de news de lacave.net |
| Message-ID | <BANLkTimFVmVWYomG_jM6JKAfStLZ2Eomcg@mail.gmail.com> (permalink) |
| References | <86667b5fe1841c16852cd7c86dc82656@ruby-forum.com> |
On Sun, May 15, 2011 at 2:35 AM, Mateus .. <excanoe@gmail.com> wrote: > Hi! > > I'm interesting, what is the best way to find nearest element in array > in comparison with "needle"? Depends - if there's a comparison function, and your array is sorted on it, then just do a binary search. If not, there's nothing better than a linear search, calculating the distance between each element and the needle. martin
Back to comp.lang.ruby | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
search nearest to elements in array (hash) "Mateus .." <excanoe@gmail.com> - 2011-05-14 16:05 -0500
Re: search nearest to elements in array (hash) serialhex <serialhex@gmail.com> - 2011-05-14 16:21 -0500
Re: search nearest to elements in array (hash) 7stud -- <bbxx789_05ss@yahoo.com> - 2011-05-14 16:28 -0500
Re: search nearest to elements in array (hash) Martin DeMello <martindemello@gmail.com> - 2011-05-14 16:33 -0500
Re: search nearest to elements in array (hash) 7stud -- <bbxx789_05ss@yahoo.com> - 2011-05-14 16:36 -0500
Re: search nearest to elements in array (hash) Martin DeMello <martindemello@gmail.com> - 2011-05-14 16:30 -0500
Re: search nearest to elements in array (hash) "Mateus .." <excanoe@gmail.com> - 2011-05-15 01:33 -0500
csiph-web