Topic: Re: to hang up an ex-fur-tree
Hello, Kodt, you wrote: Cast https://pikabu.ru/story/exel_veshaet_nout_5801336 What maximum computing complexity it is possible to organize on ? ("From a box", without macroes) If at us is N cells with formulas what most fierce update is possible at change of value of one cell? Exponential A1=a A2= (A1; "a"; "aa") A2... To fill downwards (Ctrl+D) the Linear complexity: each following cell depends on a constant amount of the previous. Square: depends on all previous (for example, the total on a column above). By the way, whether and the ex-fur-tree recognizes such formulas and whether the total? Who is more?