Question: Q1. Distinguish between an algorithm and a program. Q2.The time complexity of an algorithm is an important measure of its efficiency and is represented using
Q1. Distinguish between an algorithm and a program.
Q2.The time complexity of an algorithm is an important measure of its efficiency and is represented using 'Big O' notation. Explain, using an example, what each of the 'Big O' concepts below represent:
(i) O (1)
(ii) O (n)
(iii) O(log n)
(iv) O(n2 )
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
