t.org
Betreff: Re: [R] calculating an N50
> Given a set of integers of different values how do I calculate the
> minimum number of the largest of integers that are required, when
> summed, to equal 50% of the total sum of the the set?
>
Actually I need the value of the smallest member
2008/11/25 Jeremy Leipzig <[EMAIL PROTECTED]>:
>> Given a set of integers of different values how do I calculate the
>> minimum number of the largest of integers that are required, when
>> summed, to equal 50% of the total sum of the the set?
>>
> Actually I need the value of the smallest member su
f Of Jeremy Leipzig
> Sent: Tuesday, November 25, 2008 10:45 AM
> To: r-help@r-project.org
> Subject: Re: [R] calculating an N50
>
> > Given a set of integers of different values how do I calculate the
> > minimum number of the largest of integers that are required, when
&g
> Given a set of integers of different values how do I calculate the
> minimum number of the largest of integers that are required, when
> summed, to equal 50% of the total sum of the the set?
>
Actually I need the value of the smallest member such that the
sum of all members equal or greater to th
Given a set of integers of different values how do I calculate the
minimum number of the largest of integers that are required, when
summed, to equal 50% of the total sum of the the set?
For example,
> length(myTable$lgth)
[1] 303403
> sum(myTable$lgth)
[1] 4735396
I know through brute force that
5 matches
Mail list logo
