Big-O notation describes patterns of activity of systems in terms of standard mathematical models in which an amount of resources (time, quantity, cost, etc.) determines scope. The patterns of activity must contain input that can be isolated and modified to be improved without negatively effecting the desired outcomes of their systems. Big-O helps systems analysts describe patterns of activity as best-case, acceptable-case, or worst-case. Big-O is used in business and computer science for documenting system behavior and for arguing system improvements. Patterns of activity of systems are typically expressed as algorithms. In the simplest terms, b ig-O is an estimate of the optimal efficiency of algorithms. When comparing two or more algorithms for optimal efficiency the following criteria must be met: Algorithms were designed using the same language. Algorithms result in the same measure (e.g. running time). Algorithms use the same set of operations. Algorithms ha...
https://www.davidbrennerjr.com
https://1dbjr.blogspot.com
https://github.com/davidbrennerjr