Calculate Running Time of an Algorithm The running time of algorithm defines the time required to execute an algorithm on the given set of inputs(n). There are mainly three types of complexity cases defines to measure the running time of an algorithm also known as Asymptotic analysis. 1) Best Case : Best case also called ( Ω) omega notation which measure the best case scenario of how long an algorithm can possible take to complete given operation on (n) inputs. It's also known as lower bound. 2) Average Case : It represents by ( Θ) theta notation which measure the average time requires to complete a given operation on set of inputs. It measures between upper and lower bound running time and calculate average running time. 3) Worst Case: It defines the worst case running time of an algorithm. Also represent using ( Ο) Big-o...
Machine Learning and Data Science articles