-
-
adsmax.rar
function [x, fmax, nf] = adsmax(f, x, stopit, savit, P)
ADSMAX Alternating directions direct search method.
[x, fmax, nf] = ADSMAX(f, x0, STOPIT, SAVIT, P) attempts to
maximize the function specified by the string f, using the ...
-
-
-
-
-
-
-
LAB7.zip
Binary Tree (insert, delete, search)
-
-
binarytree.zip
Up to this point, we have assumed that an optimal search tree is one in which the probability of occurrence of all keys is
equal (or is unknown, in which case we assume it to be equal). Thus we concentrated on balancing the tree so as to
make the cost ...
-