[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: pointers and recursive algorithms
|
From: |
Jordi Gutiérrez Hermoso |
|
Subject: |
Re: pointers and recursive algorithms |
|
Date: |
Mon, 15 Mar 2010 18:24:36 -0600 |
2010/3/15 Cássio M. M. Pereira <address@hidden>:
> I would like to implement a recursive tree algorithm in octave.
Are you sure nobody has already implemented before you have?
> 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?
Why not return the actual information stored, what's the need for a
level of indirection with pointers?
If you believe there will be performance issues, you could use the C++
interface instead.