complexity function
complexity function If A is an algorithm for solving a particular class of problems and n is a measure of the size of a particular problem in this class, then a complexity function fA(n) is a function of n giving an upper bound on the maximum number of basic operations that algorithm A has to perform to solve any problem of size n. For example, n might be the number of records in a file and fA(n) the maximum number of comparisons required to sort the file. There are many algorithms and problems where the number of basic operations depend on the data rather than the size of the data (e.g. Euclid's algorithm for greatest common divisors). See also complexity measure.
More From encyclopedia.com
Complex Numbers , Numbers, Complex
The set of complex numbers includes all the numbers we commonly work with in school mathematics (whole numbers, fractions, decimals,… Primitive Recursion , primitive recursive function A function that can be obtained from certain initial functions by a finite number of applications of composition and pri… involution , in·vo·lu·tion / ˌinvəˈloōshən/ • n. 1. Physiol. the shrinkage of an organ in old age or when inactive, e.g., of the uterus after childbirth. 2. Math.… Complexity , A complex is a group of partially or totally unconscious psychic content (representations, memories, fantasies, affects, and so on), which constitute… Mahon , Mahon •Abadan, Abidjan, Amman, Antoine, Arne, Aswan, Avon, Azerbaijan, Baltistan, Baluchistan, Bantustan, barn, Bhutan, Dagestan, darn, dewan, Farne,… Hindustan , Hindustan •Abadan, Abidjan, Amman, Antoine, Arne, Aswan, Avon, Azerbaijan, Baltistan, Baluchistan, Bantustan, barn, Bhutan, Dagestan, darn, dewan, Fa…
You Might Also Like
NEARBY TERMS
complexity function