nearest valued clear solution for Nearest Value by quarkov - python coding challenges

Enable Javascript in your browser and then refresh this page, for a much enhanced experience.

nearest valued solution in Clear category for Nearest Value by quarkov

def nearest_value(values, one):
    return min({(abs(n-one), n) for n in values})[1]

April 5, 2019

Comments:

Oksana_Antropova on April 9, 2019, 4:09 p.m.
Well done!

quarkov on April 11, 2019, 7:14 a.m.
You've used the same approach=)

adogadkin on March 28, 2020, 4:37 p.m.
Is there any reasoning behind materializing the sequence in memory as a set? min() works with iterables in general

quarkov on March 28, 2020, 6:25 p.m.
<ol> <li>sets also have iterator interface and are iterable=) </li> <li>min(someiterable)_ takes O(n) time to run, where n is the length of that iterable; the shorter an iterable is, the faster you'll find its smallest element; </li> <li>using sets, you can be sure your iterable contains only unique elements and thus is the shortest and you will find the smallest element faster; </li> <li>for this particular mission it doesn't really matter though, since we are not dealing with really long iterables</li> </ol>

adogadkin on March 28, 2020, 9:48 p.m.
<ol> <li>They surely do, never said they don't :)</li> <li>set(iterable) (or comprehension in this case) takes O(n) time as well. We'll have to go through all the elements anyway, and in the worst case we will be going through all of them twice (instead of once when using generator expression). Storing those elements in memory twice is another overhead we're getting with set. Oh, and don't forget 2 extra keystrokes as well! 3.</li> <li>Well, I just wanted to make sure I 'm not missing something important. We are here to learn after all.</li> </ol>

quarkov on March 29, 2020, 7:46 a.m.
<ol> <li>your words weren't unambiguous, now I see what you meant exactly =) </li> <li>yes, you're right (from the perspective of this particular mission) because it's stated that all the elements in the input list are unique, when I was solving this task a long time ago for some reason I considered the input list might have contained repeating elements and for this situation using sets might have been beneficial; </li> <li> <ol> <li>no, you're not missing anything, thanks for asking =)</li> </ol></li> </ol>

Different kind of sets

0 %

PyCharm The Python IDE for Professional Developers. Enjoy productive Python, web and scientific development with PyCharm. Download it now!