算法和数据结构里面,AVL-tree概念的问题,An operation for an application that uses an AVL-tree is of O(log2 N) time.It takes about 50milliseconds to run on a collection of 10,000 elements.How long would you expect it wouldtake to run on a
来源:学生作业帮助网 编辑:作业帮 时间:2024/06/21 17:19:59
![算法和数据结构里面,AVL-tree概念的问题,An operation for an application that uses an AVL-tree is of O(log2 N) time.It takes about 50milliseconds to run on a collection of 10,000 elements.How long would you expect it wouldtake to run on a](/uploads/image/z/14823924-60-4.jpg?t=%E7%AE%97%E6%B3%95%E5%92%8C%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E9%87%8C%E9%9D%A2%2CAVL-tree%E6%A6%82%E5%BF%B5%E7%9A%84%E9%97%AE%E9%A2%98%2CAn+operation+for+an+application+that+uses+an+AVL-tree+is+of+O%28log2+N%29+time.It+takes+about+50milliseconds+to+run+on+a+collection+of+10%2C000+elements.How+long+would+you+expect+it+wouldtake+to+run+on+a)
算法和数据结构里面,AVL-tree概念的问题,An operation for an application that uses an AVL-tree is of O(log2 N) time.It takes about 50milliseconds to run on a collection of 10,000 elements.How long would you expect it wouldtake to run on a
算法和数据结构里面,AVL-tree概念的问题,
An operation for an application that uses an AVL-tree is of O(log2 N) time.It takes about 50
milliseconds to run on a collection of 10,000 elements.How long would you expect it would
take to run on a collection of 100,000 elements?
Note:You can give your answer as an expression that involves mathematical functions.In
other words,you do not to calculate its numerical value.
算法和数据结构里面,AVL-tree概念的问题,An operation for an application that uses an AVL-tree is of O(log2 N) time.It takes about 50milliseconds to run on a collection of 10,000 elements.How long would you expect it wouldtake to run on a
使用avl-tree的应用程序中的一个操作的时间复杂度为O(log2N).在一个有10000个元素的数据集中运行(查找),他需要花费大约50ms.那么请问,如果在有100000个元素的数据集中运行(查找)它大约需要花费多少时间?
注意:你的答案中可以保留数学函数,也即,你无需计算出具体的数值
答:应花50 * log2(100000) / log2(10000) ms