My thanks to the author for the repairs. I'll repeat my statement about how much I like the background information, references, and additional comments about incomplete Bell polynomials.
In many ways, this is a model code. There are a few imperfections, although nothing to get terribly upset over. First, what did I like?
Extensive help, that describes how to use the code, as well as background for what Bell polynomials are and where they used. References are provided. There is error checking, although I was surprised that error was not used, instead using fprintf.
The things I thought could be improved were...
There is no H1 line. This is the FIRST line of the help. It is a one line description of the code, including a few useful keywords, and used by lookfor, to allow the user who perhaps forgets the name of this function and needs to find it for later use.
I also found a bug, or rather mlint found a bug in this code. When an error is generated, this code may return its variable in one path as "Outmatrix" instead of "OutMatrix". This points out the value of mlint. This and 4 other minor items were pointed out by mlint.
Finally, I'll note that this code is looped, with an internal call to nchoosek each time. This can be simply replaced and sped up by a simple computation of the coefficients, since nchoosek(n,k) and nchoosek(n,k+1) are simply related to each other.
As I said, all relatively minor flaws, and I'll happily raise my rating here that one extra notch to a 5 when corrected.
