Welcome to the Java Programming Forums
The professional, friendly Java community. 21,500 members and growing!
The Java Programming Forums are a community of Java programmers from all around the World. Our members have a wide range of skills and they all have one thing in common: A passion to learn and code Java. We invite beginner Java programmers right through to Java professionals to post here and share your knowledge. Become a part of the community, help others, expand your knowledge of Java and enjoy talking with like minded people. Registration is quick and best of all free. We look forward to meeting you.
>> REGISTER NOW TO START POSTING
Members have full access to the forums. Advertisements are removed for registered users.
LinkBack URL
About LinkBacks
Time complexity problem?
Screen Shot 2014-02-02 at 8.04.34 PM.jpg
Hi all,
I was wondering if anyone could answer a sample question from the full question here? I understand that big-OH is the worst case, little O is the best case, and Theta notation is the bounded complexity. I just don't understand how these questions can be answered and verified? Explanation would be VERY much appreciated!
Related threads:
Reply With Quote