Difference between Posteriori and Priori analysis
Prerequisite – Analysis of Algorithms
Algorithm is a combination or sequence of finite-state to solve a given problem. If the problem is having more than one solution or algorithm then the best one is decided by the analysis based on two factors.
- CPU Time (Time Complexity)
- Main memory space (Space Complexity)
Time complexity of an algorithm can be calculated by using two methods:
- Posteriori Analysis
- Priori Analysis
Difference between Aposteriori analysis and A Priori analysis:
A Posteriori analysis |
A priori analysis |
Posteriori analysis is a relative analysis. |
Priori analysis is an absolute analysis. |
It is dependent on language of compiler and type of hardware. |
It is independent of language of compiler and types of hardware. |
It will give exact answer. |
It will give approximate answer. |
It doesn’t use asymptotic notations to represent the time complexity of an algorithm. |
It uses the asymptotic notations to represent how much time the algorithm will take in order to complete its execution. |
The time complexity of an algorithm using a posteriori analysis differ from system to system. |
The time complexity of an algorithm using a priori analysis is same for every system. |
If the time taken by the program is less, then the credit will go to compiler and hardware. |
If the algorithm running faster, credit goes to the programmer. |
It is done after execution of an algorithm. |
It is done before execution of an algorithm. |
It is costlier than priori analysis because of requirement of software and hardware for execution. |
It is cheaper than Posteriori Analysis. |
Maintenance Phase is required to tune the algorithm. |
Maintenance Phase is not required to tune the algorithm. |
Last Updated :
12 Dec, 2022
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...