Skip to content
Related Articles

Related Articles

Save Article
Improve Article
Save Article
Like Article

Difference between Posteriori and Priori analysis

  • Difficulty Level : Easy
  • Last Updated : 18 Oct, 2021

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. 

  1. CPU Time (Time Complexity)
  2. Main memory space (Space Complexity)

Time complexity of an algorithm can be calculated by using two methods: 

Attention reader! Don’t stop learning now.  Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.

Learn all GATE CS concepts with Free Live Classes on our youtube channel.

  1. Posteriori Analysis
  2. Priori Analysis

Difference between Aposteriori analysis and A Priori analysis: 
 

A Posteriori analysisA 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 program is less, then the credit will go to compiler and hardware.If the algorithm running faster, credit goes to the programmer.
My Personal Notes arrow_drop_up
Recommended Articles
Page :