功能顺序的算法问题 [英] algorithmic question for order of function

问题描述

您好:
在这种情况下，我需要两个功能:

如果f(n)= O(g(n))则对数f(n)！=对数(g(n))

其他信息:！=表示不等于

请介绍两个此函数.

解决方案

我认为O(g(n))是最坏情况下的复杂度.然后有这么简单的解决方案.如果f(n)！= g(n).....例如让f(n)= n ^ 3和g(n)= n ^ 3-4，则每个函数f(n)和g(n)都满足此要求* n + 8，则f(n)== O(g(n))bt log(f(n))不等于log(g(n))...

Hi:
I need two function in this condition:

if f(n)=O(g(n)) then Log f(n) != Log (g(n))

additional information :!= means not equal

pleas introduce two this function.

解决方案

As i think there O(g(n)) is the Order of meant worst case complexity. then there so simple solution. every functions f(n) and g(n) satisfy this if f(n)!= g(n)..... like let f(n)=n^3 and g(n)=n^3-4*n+8 then f(n)==O(g(n)) bt log(f(n)) is not equal to log(g(n))...

这篇关于功能顺序的算法问题的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！