# 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 dicided 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. | Piori 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 algorithm is less, then the credit will go to compiler and hardware. | If the program running faster, credit goes to the programmer. |

## Recommended Posts:

- Analysis of Algorithm | Set 5 (Amortized Analysis Introduction)
- Analysis of Algorithms | Set 1 (Asymptotic Analysis)
- Analysis of Algorithms | Set 4 (Analysis of Loops)
- Analysis of Algorithms | Big-O analysis
- Analysis of different sorting techniques
- Analysis of algorithms | little o and little omega notations
- Analysis of Algorithms | Set 5 (Practice Problems)
- Amortized analysis for increment in counter
- Analysis of Algorithm | Set 4 (Solving Recurrences)
- Complexity Analysis of Binary Search
- Analysis of Algorithms | Set 3 (Asymptotic Notations)
- Data flow analysis in Compiler
- Analysis of Algorithms | Set 2 (Worst, Average and Best Cases)
- Practice Questions on Time Complexity Analysis
- Compiler Design | FOLLOW Set in Syntax Analysis

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.