program A and B are analysed and found to have worst case
running time greater than 150NlogN and N*N respectively.
which program has the better guarantee after the running
time for the large values of N(N>10000)?
which program has the better guarantee for the running time
of small program N (N<100)?
which program will run faster on average for N=1000?


No Answer is Posted For this Question
Be the First to Post Answer

Post New Answer

More Java Related AllOther Interview Questions

How do you create a jar file?

0 Answers  


What is cdi bean in java?

0 Answers  


What is static class in java?

0 Answers  


I run a web server. Am I at risk? : java security

0 Answers  


Explain the inheritance principle.

0 Answers  






What can open a jar file?

0 Answers  


How do I run a java project in netbeans?

0 Answers  


What is dto in java?

0 Answers  


What is numberformatexception in java?

0 Answers  


What is data persistence in java?

0 Answers  


What is the need to declare main() method as static in Java?

12 Answers  


why i can not access private variable in other class?

4 Answers  


Categories