Computer Science, asked by Arvindgoyal3558, 10 months ago

For analyzing an algorithm which is better complexity time (a) o(1000lg n) (b) o(n) (c) o(2^n) (d) o(nlg n)

Answers

Answered by Anonymous

Explanation:

NICE RPA helps you gain unprecedented levels of business efficiency. Learn more! Increase your business performance and ROI dramatically without human intervention. Tailored to your needs. Easily scalable.

Option A is correct

Previous Question

Next Question

Similar questions

English, 5 months ago

2. How are igneous rocks formed? Give two examples of igneous rocks and their uses. 3. Why are sedimentary rocks formed in layers? re minerals? List any three uses of minerals...

English, 5 months ago

David,the actor, singer and producer, have arrived for the award show correct the error ...

Physics, 5 months ago

A changed oil drop outspended in a uniterum electric field 27.5X 104 V/m, 30 that is neither rises nore bolls. Find the charge on the drop. Give mass of the dreap is 9x 10^-15 air resistance) kg. Negred...

Chemistry, 10 months ago

Number of benzene rings in purines and pyrimidines have...

Biology, 10 months ago

What are antimicrobial agents? Enlist the astrigents?

Physics, 11 months ago

Are Photons Goldstone Bosons?

Biology, 11 months ago

in vitro pharmacological activities and gc-ms analysis of different solvent extracts of lantana camara leaves collected from tropical region of malaysia...

Physics, 11 months ago

10 kj/s of heat is produced when a dc flows through a 100 resistor...