0 votes 0 votes Please mention proper approach to solve similar questions Algorithms time-complexity algorithms + – pps121 asked Dec 7, 2018 pps121 599 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Navneet Kalra commented Dec 12, 2018 reply Follow Share s2 is true s1 is false....am i correct 0 votes 0 votes Naveen Kumar 3 commented Dec 12, 2018 reply Follow Share Is S2 true for f(n)=$e^n$ ?? 0 votes 0 votes Navneet Kalra commented Dec 12, 2018 reply Follow Share yes naveen....I am wrong here both statements will be false for e^n it is not correct ......even for any exponential function like 2^n and any other it will be false both statements are false 1 votes 1 votes kirtipurohit commented Jan 9, 2022 reply Follow Share Atleast provide the answer key. Sahi direction me to soch skte hai 0 votes 0 votes Please log in or register to add a comment.
