Given a list of integers, I need to find the closests numbers to each other inside the list
>> [1,9,5,45,80,2]
>> closest(lst)
>> 1,2
Is there any quick way to do this?
Asked
Active
Viewed 51 times
-2
-
Google searching "find the two closest numbers in a list" yields lots of results, by the way. It's typically O(n^2) time. – swagrov Feb 25 '19 at 23:20
-
1If you ask without trying, you may regret losing all the fun :o) – Davide Fiocco Feb 25 '19 at 23:20
-
Duplicate of https://stackoverflow.com/questions/36831127/finding-the-two-closest-numbers-in-a-list-using-sorting – swagrov Feb 25 '19 at 23:20
1 Answers
1
- Sort the list
- Subtract adjacent elements
- Take the minimum of those differences
Prune
- 76,765
- 14
- 60
- 81