yattias
asked on
Big O Notation
This question is not very difficult but it is urgent and I do need a good explanation for it.
Can anyone tell me how to calculate big O notations of algorithms ?(I am not providing you with one because I dont have one specific in mind), especially while, for or any other iterated loops. Can you please be descriptive because I need to really know this for my final exam and its very urgent. Can you tell me how to calculate it for various cases and show me what algorithm will give O(nlog(n)). Please help
Can anyone tell me how to calculate big O notations of algorithms ?(I am not providing you with one because I dont have one specific in mind), especially while, for or any other iterated loops. Can you please be descriptive because I need to really know this for my final exam and its very urgent. Can you tell me how to calculate it for various cases and show me what algorithm will give O(nlog(n)). Please help
Mayank S
This is not essentially a Java question, it might be better answered in the Programming TA.
For example:
for ( int i = 0 ; i < n ; i ++ ) // a loop which runs n times
for ( int j = 0 ; j < n ; j ++ ) // a loop which runs n times each time the outer loop runs (which is also n times)
Hence the above has an order of n-square.
for ( int i = 0 ; i < n ; i ++ ) // a loop which runs n times
for ( int j = 0 ; j < n ; j ++ ) // a loop which runs n times each time the outer loop runs (which is also n times)
Hence the above has an order of n-square.
This has some explanation for computing it for sorting algorithms:
http://www.ics.uci.edu/~eppstein/161/960116.html
http://www.ics.uci.edu/~eppstein/161/960116.html
https://www.experts-exchange.com/questions/21818669/What-is-the-Big-O-notation.html
https://www.experts-exchange.com/questions/20478405/Big-O-Calculations-for-log2n.html
http://www.cprogramming.com/tutorial/computersciencetheory/algorithmicefficiency3.html
there have been many questions on this topic.
if u give a search for "big O" in experts exchange site , then u will loads of answers.
https://www.experts-exchange.com/questions/20478405/Big-O-Calculations-for-log2n.html
http://www.cprogramming.com/tutorial/computersciencetheory/algorithmicefficiency3.html
there have been many questions on this topic.
if u give a search for "big O" in experts exchange site , then u will loads of answers.
ASKER CERTIFIED SOLUTION
membership
This solution is only available to members.
To access this solution, you must be a member of Experts Exchange.