"An O(n)-time algorithm always runs faster than an Θ(2n)-time algorithm." is it correct? please explain in detail and show the steps?
回答 (1)
2016-09-11 4:01 pm
nop! O(n) may actually be n/2
收錄日期: 2021-05-04 02:12:38
原文連結 [永久失效]:
https://hk.answers.yahoo.com/question/index?qid=20160911004400AAnk7yM