Back to Blog

Introduction to Algorithm and Apriori Analysis

Introduction to Algorithm and Apriori Analysis

Steps to construct an algorithm

Problem Definition

Design Algorithm

Approaches: Divide & Conquer Greedy algorithm Dynamic Programming (DP) and many more

Draw Flow chart

Testing

Implementation

Analysis

Time vs Space Analysis (complexity)

Goal - Lesser time & space complexity

Asymptotic notations

Big O (worst case scenario)

Omega (Best case scenario)

Theta (Average case scenario)

Apostiary analysis (depends on language of compiler and type of hardware)

Apriori analysis (independent of hardware)

  • Order of magnitude of a statement