Introduction

O(n) for Linear Search – Time Complexity is on) when you are going & asking each student individually about problem.

10 0 (log n) for Binary Search-Time Complexity is O(log n) O when you divide the class into 2 halves groups

b.) Space Complexity

– Space complexity is the amount of memory required by algorithm an complete its task or solve a particular problem for input size (/n)

Determining space-The memory required by ap equal of algorithm is to the variable dynamic part.

Complexity

4. Fixed Part is the space required to store data & variables who is independent of the size of the problem.

Example- Simple Variables, constants & program size