Ask
Login
0
4.1kviews
Explain Big-oh, Omega and theta notation with the help of digram. How do we analyze and measure time complexity algorithm?
written 7.9 years ago by gravatar for satishmanje93 satishmanje93 • 250 modified 3.8 years ago by gravatar for sagarkolekar sagarkolekar ★ 11k
analysis of algorithms
ADD COMMENT EDIT
1 Answer
0
104views
written 3.8 years ago by gravatar for Krishna_Agrawal Krishna_Agrawal • 2.7k

Asymptotic Notation : -

Asymptotic Notation is used to describe the running time of an algorithm - how much time an algorithm takes with a given input, n.


There are three different notations:

  1. Big O Notation
  2. Big Theta (Θ) Notation
  3. Big Omega (Ω) Notation


Big-Θ is used when the running …

Create a free account to keep reading this post.

and 5 others joined a min ago.

ADD COMMENT EDIT
Please log in to add an answer.