Scribd
Upload
51 views1 page

Asymptotic Notation

The document discusses the execution time of algorithms, emphasizing that primitive operations take the same time and are executed sequentially. It introduces asymptotic notations for measuring time complexity, particularly for large input sizes. Additionally, it presents polynomial expressions related to algorithm performance.

Uploaded by

Madeehah Aatif
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as ODT, PDF, TXT or read online on Scribd
51 views1 page

Asymptotic Notation

The document discusses the execution time of algorithms, emphasizing that primitive operations take the same time and are executed sequentially. It introduces asymptotic notations for measuring time complexity, particularly for large input sizes. Additionally, it presents polynomial expressions related to algorithm performance.

Uploaded by

Madeehah Aatif
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as ODT, PDF, TXT or read online on Scribd
You are on page 1/ 1

RAM: (independent of software and hardware)

-unit time to execute a statement


-will execute in sequence
-primitive operations(+,-, *) will take same time.

Asymptotic Notations:
-To Measure efficiency(time complexity) of algorithms
-large inputs

running time/computational time/execution time of an algorithm= time complexity of an algorithm

p(x)=anxn+ an-1xn-1+………... a1x1+a0

x2+3x

an2+bn+c

8-0
4-0
2-0
1-0

10000

You might also like