How to calculate big O, omega and theta of any algorithm?

Recommended Answers

All 2 Replies

By looking at the algorithm and reasoning about the effect changing the variable workload has on the time taken.

Its very well explained in 'Introduction To Algorithms' by Coreman, Leiserson, Rivest and Stein. Its a good book. There are a number of ways for can find the complexity, few good methods are explained in there. Hope it would be help to you.

Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.