in reply to Re^3: optimize percentile counting in hash
in thread optimize percentile counting in hash
its giving incorrect percentile values :(
to find percentile rank of score x out of n scores:
(number of scores below x)/n*100 = percentile rank
need to sort the hash first, i used index value of
the array to find number of scores below x.
x is value of hash taken one by one and returning the percentile
|
---|
Replies are listed 'Best First'. | |
---|---|
Re^5: optimize percentile counting in hash
by ikegami (Patriarch) on Mar 21, 2008 at 02:40 UTC |