step start step step stop herewe have three variables aband and one constant hence ( nowspace depends on data types of given variables and constant types and it will be multiplied accordingly time complexity time complexity of an algorithm represents the amount of time required by the algorithm to run to completion time requirements can be defined as numerical function ( )where (ncan be measured as the number of stepsprovided each step consumes constant time for exampleaddition of two -bit integers takes steps consequentlythe total computational time is (nc nwhere is the time taken for the addition of two bits herewe observe that (ngrows linearly as the input size increases