Finding closest match in collection of numbers [closed]

by

11 bytes in J:

C=:0{]/:|@-

Examples:

>> a =: 1 3 8 10 13
>> 4 C a
3
>> 11 C a
10
>> 12 C a
13

my breakdown for the layman:

0{         First element of
]          the right argument
/:         sorted by
|          absolute value 
@          of
-          subtraction

More Related Contents:

  1. Code Golf: Number to Words
  2. What’s the shortest code to cause a stack overflow? [closed]
  3. Build an ASCII chart of the most commonly used words in a given text [closed]
  4. Code Golf: Conway’s Game of Life
  5. What’s the difference between passing by reference vs. passing by value?
  6. Shortest distance between a point and a line segment
  7. What’s your most controversial programming opinion?
  8. What is a callback function?
  9. Is a GUID unique 100% of the time?
  10. Runtime vs. Compile time
  11. What’s your favorite “programmer” cartoon?
  12. De Morgan’s rules explained
  13. What is boxing and unboxing and what are the trade offs?
  14. What is name mangling, and how does it work?
  15. Given an integer, how do I find the next largest power of two using bit-twiddling?
  16. How can I find the difference between two angles?
  17. What’s the point of OOP?
  18. What is an integer overflow error?
  19. Why does division by zero in IEEE754 standard results in Infinite value?
  20. Is Method Overloading considered polymorphism? [closed]
  21. What is an invariant?
  22. Arguments or parameters? [duplicate]
  23. What is an ideal variable naming convention for loop variables? [closed]
  24. Should we compare floating point numbers for equality against a *relative* error?
  25. Is Sleep() evil?
  26. Recursion or iteration?
  27. What does ‘foo’ really mean? [closed]
  28. What are “magic numbers” in computer programming?
  29. Why would a language NOT use Short-circuit evaluation?
  30. Is there a known implementation of an indexed linked list?

Leave a Comment