fixed part that is space required to store certain data and variables ( simple variables and constantsprogram size etc )that are not dependent of the size of the problem variable part is space required by variableswhose size is totally dependent on the size of the problem for examplerecursion stack spacedynamic memory allocation etc space complexity (pof any algorithm is (pa sp(iwhere is treated as the fixed part and (iis treated as the variable part of the algorithm which depends on instance characteristic following is simple example that tries to explain the concept algorithm sum(pqstep start step step stop here we have three variables pq and and one constant hence ( + now space is dependent on data types of given constant types and variables and it will be multiplied accordingly time complexity time complexity of an algorithm is the representation of the amount of time required by the algorithm to execute to completion time requirements can be denoted or defined as numerical function ( )where (ncan be measured as the number of stepsprovided each step takes constant time for examplein case of addition of two -bit integersn steps are taken consequentlythe total computational time is (nc*nwhere is the time consumed for addition of two bits herewe observe that (ngrows linearly as input size increases asymptotic notations asymptotic notations are used to represent the complexities of algorithms for asymptotic analysis these notations are mathematical tools to represent the complexities there are three notations that are commonly used big oh notation big-oh (onotation gives an upper bound for function (nto within constant factor we write (no( ( ))if there are positive constants and such thatto the right of the (nalways lies on or below * (no( ( ) (nthere exist positive constant and such that < ( < ( )for all <