Category Archives: Algorithms

In my previous post I discussed about the different asymptotic notations and its significance.This post discusses how to calculate the running time of an algorithm and represent it using the Big O notation. Prerequisites: Basic knowledge of asymptotic bounding and asymptotic notations is required. Refer below links to get some basic knowledge on asymptotic boundingContinue reading “How to calculate time complexity of an algorithm”