Polynomial Time Approximation Scheme
Polynomial Time Approximation Scheme (PTAS) is a type of approximate algorithms that provide user to control over accuracy...
Author
Venkatesan Prabu
Wikitechy Founder, Author, International Speaker, and Job Consultant. My role as the CEO of Wikitechy, I help businesses build their next generation digital platforms and help with their product innovation and growth strategy. I'm a frequent speaker at tech conferences and events.
2834 Articles
Time Complexity of building a heap
Time Complexity of building a heap - Analysis of Algorithm - Consider the following algorithm for building a Heap of an...
A Time Complexity Question
A Time Complexity Question - Analysis of Algorithm What is the time complexity of following function fun()? Assume that...
NP Completeness
NP Completeness- Analysis of Algorithm - In this post,failure stories of computer science are discussed.Can all...
Pseudo polynomial Algorithms
pseudo polynomial Algorithms - Analysis of Algorithm - An algorithm whose worst case time complexity depends on numeric...
Space Complexity mean
Space Complexity mean - Analysis of Algorithm The term Space Complexity is misused for Auxiliary Space at many places....
Amortized Analysis Introduction
Amortized Analysis Introduction - Analysis of Algorithm Amortized Analysis is used for algorithms where an occasional...
Solving Recurrences
Solving Recurrences - Analysis of Algorithm -Many algorithms are recursive in nature. When we analyze them, we get a...
Asymptotic Notations
Asymptotic Notations - Analysis of Algorithms The main idea of asymptotic analysis is to have a measure of efficiency of...
How to Install iOS 10 Beta on Your iPhone
How to Install iOS 10 Beta on Your iPhone - Mobile - Apple has made various significant declarations at its yearly WWDC...
