Computer Science, asked by siddhu1033, 1 year 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

Science, 7 months ago

Design a leaf spring for the following specifications: Total load=140Kn,Number of springs supported the the load=4,Maximum number of leaves=10, Span of the spring=1000mm,Permisible deflection =80mm,E=200KN/mm and allowable stress in spring material as 600mpa.

English, 7 months ago

.........of the student will be given a copy to the magazine.(any/every/each)...

Geography, 7 months ago

The latitudinal differences in pressure delineate a number of major pressure zones, which correspond with A. zones of climate B. zones of oceans C. zones of land D. zones of cyclonic depressions...

Physics, 1 year ago

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

Computer Science, 1 year 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...