Re: pointers and recursive algorithms

[Sergei Steshenko]

--- On Mon, 3/15/10, Cássio M. M. Pereira <address@hidden> wrote:

> From: Cássio M. M. Pereira <address@hidden>
> Subject: pointers and recursive algorithms
> To: address@hidden
> Date: Monday, March 15, 2010, 1:34 PM
> 
> Dear list,
> 
> I would like to implement a recursive tree algorithm in
> octave.
> As far as I know, Octave does not support pointer types.
> It seems to me that the most appropriate structure to
> implement a tree
> in octave would be a (nested) cell array.
> 
> However, how can I, for instance, make a recursive binary
> search in a tree
> (implemented as a cell array) and return a pointer to the
> cell where the
> information is stored?
> 
> If pointers are not available, is there another way to get
> around this?
> 
> Thank you,
> Cássio Pereira
> -----Inline Attachment Follows-----
> 


Well, I happily combine 'octave' and Perl - through 'system'.

Regards,
  Sergei.