Question

Explain the Big- oh computation
lach of the following central
O Sequencing :
for
structuresplay please answer me ​

Answer 1

Answer:

Big O notation is used in Computer Science to describe the performance or complexity of an algorithm. Big O specifically describes the worst-case scenario, and can be used to describe the execution time required or the space used (e.g. in memory or on disk) by an algorithm.

Explanation: