merge sort time complexity
Answers were Sorted based on User's Feedback
Answer / banti sharma
Right its always (nlog n)in all cases whether its best case
or worst case.
Is This Answer Correct ? | 69 Yes | 16 No |
Answer / ashfaque
Its correct in every cases , may be average, worst or best..
The time complexity is always O(n log n)
Is This Answer Correct ? | 34 Yes | 8 No |
Answer / a. raju
mergsort best case and worst case time colexcity is 0(n log n)
and worst time complex city 0(n+m).
Is This Answer Correct ? | 9 Yes | 21 No |
through which algorithm does the garbage collector works? how the garbage collector will understand that the object will going to be deleted?
I want to insert date in the form of yyyy-mm-dd... if any changes happen while inserting date format want to show error meg...any one can solve this..??
6.int x=10; float y=20; a=x%2=? b=y%2=?
hi This is radhika.Can anyone help me to know the question papers of NATIONAL INFORMATICS CENTRE for the post of scientific officer/engineer? if anyone know plz tell me question paper pattern
what is the current salary package in India for a lamp programmer
what is delegate and how works delegate and event.
why Java is not purely object oriented?
what is integration testing in real time applications?
How to merge Action Form with Dyna Action Form in Struts.
Write a program to implement BFS/ DFS routine in a connected graph
Suppose we are doing 4 operations on database using service, first operation is successful but due to some reason remaining 3 operations are failed. I) is this transaction successful or not? ii) How can you give that error message to user?
There are 2 tables: EMP : EmpId, Ename, Sal, DeptId DEPT : DeptId, Dname Write a query to find out emp names and their department names. if any emp has null in Deptid the it shows ?No Department?. Write a query to find out those department names which has no employee. Write a query to find out those employees whose salary is greater than their department?s average salary.