Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

TIME COMPLEXITY ANALYSIS, Lecture notes of Data Structures and Algorithms

Iterative analysis of programs and comparison functions are described in this pdf

Typology: Lecture notes

2019/2020

Uploaded on 12/05/2020

m-vinitha
m-vinitha 🇮🇳

2 documents

1 / 8

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Scanned by CamScanner
pf3
pf4
pf5
pf8

Partial preview of the text

Download TIME COMPLEXITY ANALYSIS and more Lecture notes Data Structures and Algorithms in PDF only on Docsity!

Comparison of functions ¢ ear aon | In general order ob -unctions — L 9 | [cere coege echentc. aed. | | = ckion3 even though though -{unctions order is Same bub “ co wil behave dityer abler some large vatue OF © eu Lon) 2 oy gina” Med 4 Q Fem i we GU Gg Fon) = 90) =a q le aay 49 : a3 So we can soy jase bY looking which one 4 . 0 - =, e oy So we need to check for large valu te greater, 0 Te “ok one w au how Yt will behave, then only a iS bigger or omoler , ienplify. . Tr order to check we rau apply tog and sinpltg Log anlhnic — PaopectieS: ane” ae A. loga” ek R- Logtabd = toga + tog 3, tog (le) = fog a - og 4. Logg? = nlogo- 5. tae os plea Vy C, ah a =H Reo b= 09a. nese Scanned by CamScanner