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

What are anonymous methods and lambda expression?

0 Answers  


What's a code group? : java security

0 Answers  


What are java’s rules regarding tabs, spaces and newline characters?

0 Answers  


Is java installed on windows 10?

0 Answers  


What is hql in java?

0 Answers  






What is the difference between map and flatmap in java?

0 Answers  


What is a yaml file in java?

0 Answers  


What is log4j in java?

0 Answers  


When do we go for java 8 stream api? Why do we need to use java 8 stream api in our projects?

0 Answers  


Is jar an executable?

0 Answers  


What is injection in java?

0 Answers  


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

12 Answers  


Categories