Write short note on : Prims Algorithm and derive its time complexity.
Answers
In computer science, the analysis of algorithms is the determination of thecomputational complexity of algorithms, that is the amount of time, storage and/or other resources necessary to execute them. Usually, this involves determining a functionthat relates the length of an algorithm's input to the number of steps it takes (its time complexity) or the number of storage locations it uses (its space complexity). An algorithm is said to be efficient when this function's values are small, or grow slowly compared to a growth in the size of the input. Different inputs of the same length may cause the algorithm to have different behavior, sobest, worst and average case descriptions might all be of practical interest. When not otherwise specified, the function describing the performance of an algorithm is usually anupper bound, determined from the worst case inputs to the algorithm.