Created
Aug 5, 2025Last Modified
8 months agoAlgorithm
Algorithm
Finite sequence of instruction used to get the desired output with necessary input value in algorithm every instruction must be clear definite ambiguous and simple
Example of algorithm
sorting algorithm
searching algorithm
shortest path algorithm
optimisation algorithm
Performance measurement of an algorithm
in general of performance of an algorithm is measured by two parameters time complexity space complexity
Time complexityTime complexity
the time complexity of an algorithm represent the time required of the algorithm to run to its completion time complexity is a function of in denoted by TN where is input site
Space complexity
the space complexity of an algorithm represents space requirement of the algorithm to run to its completion denoted by S of n where n is input size
