tor, 30 10 2008 kl. 17:05 -0400, skrev Dave Goel: > There seems to be no easy way to achieve a cummax (a simple O(n) > operation) while avoiding loops. There are some ways to achieve > it[1], but they all end up being > O(n).
Yeah, I can't come up with anything of the top of my head. But I'll make you a deal. If you write an m-file version using for-loops, that handle the N-dimensional case, then I'll re-implement it in C++. Søren ------------------------------------------------------------------------- This SF.Net email is sponsored by the Moblin Your Move Developer's challenge Build the coolest Linux based applications with Moblin SDK & win great prizes Grand prize is a trip for two to an Open Source event anywhere in the world http://moblin-contest.org/redirect.php?banner_id=100&url=/ _______________________________________________ Octave-dev mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/octave-dev
