Archive for June, 2006

« newer posts
Friday, June 2nd, 2006

Finding the n smallest elements in an array

Finding the n smallest elements of an array is a common problem with an informative solution. It is not necessary to sort the entire array to solve this problem. To solve it, I’m going to use HISTOGRAM in a slightly non-intuitive manner (or maybe it is intuitive if you’ve read J.D. Smith’s Histogram Tutorial).

1 Comment » - Posted in IDL,Optimization by

« newer posts