A Time Complexity Question – Analysis of Algorithm What is the time complexity of following function fun()? Assume that log(x) returns log value in base 2.
Analysis of Algorithm
17 Articles
17
NP Completeness- Analysis of Algorithm – In this post,failure stories of computer science are discussed.Can all computational problems be solved by a computer
pseudo polynomial Algorithms – Analysis of Algorithm – An algorithm whose worst case time complexity depends on numeric value of input (not number of inputs)
Space Complexity mean – Analysis of Algorithm The term Space Complexity is misused for Auxiliary Space at many places. Following are the correct
Amortized Analysis Introduction – Analysis of Algorithm Amortized Analysis is used for algorithms where an occasional operation is very slow, but most of
Solving Recurrences – Analysis of Algorithm -Many algorithms are recursive in nature. When we analyze them, we get a recurrence relation for time complexity
Asymptotic Notations – Analysis of Algorithms The main idea of asymptotic analysis is to have a measure of efficiency of algorithms that doesn’t depend on