  We obtain a sharp upper bound for the length of arbitrary non-associative
algebra and present an example demonstrating the sharpness of our bound. To
show this we introduce a new method of characteristic sequences based on linear
algebra technique. This method provides an efficient tool for computing the
length function in non-associative case. Then we apply the introduced method to
obtain an upper bound for the length of an arbitrary locally complex algebra.
We also show that the obtained bound is sharp. In the last case the length is
bounded in terms of Fibonacci sequence.
