Sorting is always at least O(n log n). Checking each element is O(n). You don't save anything here by sorting.
Corion: why are you trying to avoid looping? Even if you write some code to solve this problem that doesn't look like it's looping, trust me, it is.
In reply to Re^2: Calculated % of data greater than $x in an array
by Anonymous Monk
in thread Calculated % of data greater than $x in an array
by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |