0 votes 0 votes What is the smallest value of $n$ such that an algorithm whose running time is $100n^2$ runs faster than an algorithm whose running time is $2^n$ on the same machine? Algorithms cormen algorithms descriptive + – akash.dinkar12 asked Jun 25, 2019 akash.dinkar12 377 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Ashwani Kumar 2 commented Jun 25, 2019 reply Follow Share Getting 15....is it correct? 0 votes 0 votes srestha commented Jun 25, 2019 reply Follow Share is it ever possible, polynomial function runs faster than exponential function? 0 votes 0 votes Ashwani Kumar 2 commented Jun 26, 2019 reply Follow Share Polynomial function run faster than exponential function...means it will take less time than exponential function i.e $100 n^{2}<2^{n}$ right? 0 votes 0 votes Please log in or register to add a comment.