Solved

# Big O Notation

Posted on 2006-05-02

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