Alqoyrs tha Finite set of cteps fo olve nS cated algoyi thay Analysis is ¢ ™ com aes) HO algorithan ibh respect io Space F¢ , Asymptot ce Notation : if 4 Big-O Co) 7H 9.0nd 14.003 3) wil) always be a grea ter than _C-9(n) fn) =O 9M) = ae peice tra. . - FIny¢-¢- 9m) a i daar eeME leak ms £79 30x Kyo Eee ome Oman a Ne £Cn)= tu gcn) $e 3 : t yea aes £Cm}—always be grea ten + C Haan equal +0 _C.g (ny er Ftd 3-4 —- a 2 ma § =BeSt Mace i = 3) theta (6) — Average Case 7 tf ¢ on — Exact timeppey Bound (Big 0 nota+ F(n) ¢ O(9¢n)d) The upper pound represem+s +ne maximum growth rate of a functhon 4¢n) In velatior tO. another — function gin). rt _ indicates +nat fn) wrth not row) _foSterr _-+than. gtn) for _Suffreventiy” large values of m 2, Lower Bound (Big Omega notation) : £(n) % (94009) = The lawer bound x+sepresemts the minimum growth rote of function tn) concerning another _— function go) It indreates +hat F070) will pot rou Slower than gen) for Sufficiemty large _yolues of n° 3|__Big Theta notation | fon) = OCaen)) | =—Theta notation represents both Seen rene di | lower bounds for aq ___ function fcr) 1m | elation 4 another funchion 90). Tt __| indreates dnat fem) will _grow _at the «same toe ££ iciemt) las vote as gin) ich y a ge values of 1- These notations are essenta) in analyzing 11 % ef fici er formant ao provid: a__ clear Understanding of how +neir — _| 4ime and space _Complerities behave as the input Size Intreases: