术语 | 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 fA(n), the complexity function, is that 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.Forexample, n might be the number of records in a file and fA(n) the maximum number of comparisons required to sort the file. 设A是解某特殊类型问题的算法,n是表示该类问题中某一问题规模大小的一个参数,则fA(n)是其复杂性函数,表示用算法A解规模为n的此类问题时基本运算数目的上限。例如,n是一个文件中记录的个数, fA(n)表示对此文件进行分类时所需的比较运算的最大数目。 |
随便看 |
|
计算机英汉双解词典包含21137条计算机术语英汉翻译词条,基本涵盖了全部常用计算机术语的翻译及用法,是计算机学习及翻译工作的有利工具。