0 votes 0 votes Arrange the following functions in decreasing asymptotic order: f(n)= 32^n g(n)= n!n3 (a) f(n),g(n) (b) g(n),f(n) Somoshree Datta 5 asked Sep 30, 2018 Somoshree Datta 5 231 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Somoshree Datta 5 commented Sep 30, 2018 reply Follow Share Shouldn't the answer be option (b) since factorial functions grow faster than exponential functions? 0 votes 0 votes Rishav Kumar Singh commented Sep 30, 2018 reply Follow Share Apply log on both functions log(32^n) = 2n log3 = O(2n) log(n!n3) = log n! + 3logn = O(nlogn) [ we know log n! = O(nlogn) ] O(2n) > O(nlogn) So, option (a) is correct. 3 votes 3 votes Somoshree Datta 5 commented Sep 30, 2018 reply Follow Share ok..got it..thanks :) 0 votes 0 votes Please log in or register to add a comment.