A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
The Big-O of Mathematics and Computer Science
2022
Journal of Applied Mathematics and Computation
In this paper, we review the basic notion of the Big-O notation, also known as the Bachmann-Landau notation, that is frequent and prevalent in the study of the computational complexity of algorithms. Though this notation has been in use for quite some time, the authors feel that there is still scope for some literature in this direction. And this paper is an attempt for the same. We start with the discussion of a very brief chronological history of the various attempts made at understanding and
doi:10.26855/jamc.2022.03.001
fatcat:szd2lqwuuresld2qjxqx5hpbma