Computer Science, asked by siddhu1033, 10 months ago

Define Big 'O' notation. State the two factors which determine the complexity of an algorithm.

Answers

Answered by nidhipanthi0

big o notation is used to depict the growth rate and the change in algorithms performance when the size is increased. two factor that can determine complexity of an algorithm are :

1 Time to run an Algorithm

2 Space needed to run an algorithm

Previous Question

Next Question

Similar questions

English, 5 months ago

choose the correct sentence 1. he speaks English like English 2. he speaks the English like English 3. he speaks English like the English 4. he speaks the English like the English...

Physics, 5 months ago

Which one of the following pairs of quantities has the same dimension? * force and work done energy and work done force and momentum force and pressure ...

Science, 5 months ago

Write true or false exercise 1. Human being are omnivores __ 2. Animals which eat the flesh of other animals are called herbivores __ 3. Chicken eggs are a rice source of proteins and vitamins. ___ 4. Animals which eat both plant and flesh of other animals are called carnivores. ____ 5. Cauliflower is a rice source of minerals and vitamins. ____...

Physics, 10 months ago

A semicircular wire of radius 5 cm carries a current...

Computer Science, 10 months ago

What is exceptional handling ? Also, state the purpose of finally block in a try catch statement.

Science, 1 year ago

really wants to know why animals like cow cannot give their food properly at the time and take it in...

Social Sciences, 1 year ago

1.elaborate educational facilities in palampur? 2.decribe different types of economic activities?

Social Sciences, 1 year ago

Describe the economic depression on 1923 in germany...