0 votes 0 votes Algorithms time-complexity algorithms asymptotic-notation test-series + – harshit agarwal asked Nov 7, 2016 • retagged Jul 13, 2022 by makhdoom ghaya harshit agarwal 395 views answer comment Share Follow See 1 comment See all 1 1 comment reply Pavan Kumar Munnam commented Nov 8, 2016 reply Follow Share c is the answer? 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes May be the ans should be option d since when it is said that Z has double exponential over the input size 'n' as per the description as compared to X. And Big Oh notation is used to describe the worst case complexity. Devshree Dubey answered Nov 8, 2016 Devshree Dubey comment Share Follow See 1 comment See all 1 1 comment reply Devshree Dubey commented Nov 8, 2016 reply Follow Share And X has polynomial input time over Z which suggests tat Z inevitably wud take more time. 0 votes 0 votes Please log in or register to add a comment.
