6 1 Pair Functions Indicate Algorithm Runtimes Function N Assume K E 1 2 E 0 E 1 Pair Wan Q43827194
![(6] 1. The pair of functions below indicate algorithm runtimes as a function of n. Assume that k E {1,2,..}, e> 0, and e > 1.](https://media.cheggcdn.com/media/f35/f350c58a-77db-47ce-ab53-1745860c6484/image.png)
thank you! with explanation will be great!
(6] 1. The pair of functions below indicate algorithm runtimes as a function of n. Assume that k E {1,2,..}, e> 0, and e > 1. For each pair we want to determine which functions are Big-N of one another. Write: • LEFT: if left e 2(right), i.e., the function on the left is Big-2 of the function on the right. • RIGHT if right E 2(left). • SAME if left = 0(right). There is no need to justify your answers. [1] (a) 2″ vs. 2n/2 [1] (b) log* n vs. nº [1] (c) n vs. log(c”) [1] (d) c” vs. 2log{n*)} log(n) [1] (e) vs. 1 TL (1] (f) “i vs. 2log2(n) Show transcribed image text (6] 1. The pair of functions below indicate algorithm runtimes as a function of n. Assume that k E {1,2,..}, e> 0, and e > 1. For each pair we want to determine which functions are Big-N of one another. Write: • LEFT: if left e 2(right), i.e., the function on the left is Big-2 of the function on the right. • RIGHT if right E 2(left). • SAME if left = 0(right). There is no need to justify your answers. [1] (a) 2″ vs. 2n/2 [1] (b) log* n vs. nº [1] (c) n vs. log(c”) [1] (d) c” vs. 2log{n*)} log(n) [1] (e) vs. 1 TL (1] (f) “i vs. 2log2(n)
Expert Answer
Answer to (6] 1. The pair of functions below indicate algorithm runtimes as a function of n. Assume that k E {1,2,..}, e> 0, and e…
OR