I would create a matrix A[i,j] with i = 1,2,3,...31 (31 rows) and
j=1,2,3,...20 (20 columns).
Initialize the matrix to all zeroes.
Then for each day of the month, if the number "k" occurs in day j, then
set A[j,k] := 1.
At the end of the month, the sum of the elements in row k will tell you
how
On 09/03/13 3:06, appjaws wrote:
I have a series of results, for each day of the month I have 10 numbers
ranging from 1 to 20. i.e.
Day11,3,4,5,7,9,12,16,17,20
Day23,4,5,6,8,9,15,17,18,19
...
I just realised that I need to sort the numbers because they are not
like my example above. So
On 09/03/13 12:11, Howard Page-Clark wrote:
On 09/03/13 11:12, appjaws wrote:
Hi all,
I have a series of results, for each day of the month I have 10 numbers
ranging from 1 to 20. i.e.
Day11,3,4,5,7,9,12,16,17,20
Day23,4,5,6,8,9,15,17,18,19
etc.
Question 1 how can I find the number of 1
On 09/03/13 11:12, appjaws wrote:
Hi all,
I have a series of results, for each day of the month I have 10 numbers
ranging from 1 to 20. i.e.
Day11,3,4,5,7,9,12,16,17,20
Day23,4,5,6,8,9,15,17,18,19
etc.
Question 1 how can I find the number of 1's 2's 3's 4's etc. for the
whole month serie
Hi all,
I have a series of results, for each day of the month I have 10 numbers
ranging from 1 to 20. i.e.
Day11,3,4,5,7,9,12,16,17,20
Day23,4,5,6,8,9,15,17,18,19
etc.
Question 1 how can I find the number of 1's 2's 3's 4's etc. for the
whole month series?
Question 2 How can I test f
On 03/04/2013 12:45 AM, matt...@accordancebible.com wrote:
> Ludo,
>
> Thank you very much for your most informative posting. I have spent the week
> trying to implement the msdn examples in pure Pascal and in Pascal-DLL
> hybrids. Success in non-threaded asynchrosity eludes me though.
>
>
