help-octave
[Top][All Lists]
Advanced

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [newbie] constructing a discrete dataset


From: Juan Pablo Carbajal
Subject: Re: [newbie] constructing a discrete dataset
Date: Thu, 30 Jan 2014 14:00:11 +0100

On Thu, Jan 30, 2014 at 6:01 AM, Jean Dubois <address@hidden> wrote:
> 2014-01-30 Jean Dubois <address@hidden>:
>> 2014-01-30 c. <address@hidden>:
>>>
>>> On 30 Jan 2014, at 05:21, Jean Dubois <address@hidden> wrote:
>>>
>>>> Thanks for pointing that out, but I'm still having a problem as you
>>>> can seen bleow:
>>>> octave:4> pkg load statistics
>>>
>>> type
>>>
>>> pkg list
>>>
>>> to see the list of installed packages.
>>>
>>> If statistics is indeed there, and is loaded,
>>>
>>> pkg describe -verbose statistics
>>>
>>> to see  the list of functions in the package.
> Thanks for these very useful suggestions
> I see the statistics package is available now.
> I also noticed that there isn't a combnk function
> available in the version of octave (3.2.4) + octave-statistics I have 
> installed
>>>
>>> Anyway combnk does not do what you want:
>>>
>>>>> combnk (1:3, 6)
>>> ans = []
> OK, I'll try it otherwise
> kind regards,
> jean

Jean,

I can't really guess what you are trying to do. If you are trying to
see of difficult is to solve a problem, what you really want to know
is how the time of computation scales with the size of your input. In
this case I guess is the size of the table you are trying to build
(which as C pointed out is just an enumeration). So, it that you want
to know how long it takes to change the base of an integer to another
base? or are you using these results to solve something else?

If you want to benchmark a problem you should look at the function
"speed", but do not go crazy with the size of the problems, the trend
is what you should be looking at.


reply via email to

[Prev in Thread] Current Thread [Next in Thread]