What is the merger sort principle and its time complexity.
- 1 Answers
- 1281 Views
- Verifone, I also Faced
- E-Mail Answers
Answer / Sayema Arif
Merger Sort is a divide-and-conquer sorting algorithm that sorts large lists by repeatedly dividing them into smaller sublists, sorting each sublist independently, and then merging the sorted sublists. Its average time complexity is O(n log n) and its worst-case time complexity is also O(n log n).
| Is This Answer Correct ? | 0 Yes | 0 No |
what is throws keyword
Write a shell program. Enter number of days from keyboard. Find out the number of years, month and days it contains
WHAT IS MAIN IMPORTANT THING IN SOFTWARE?
Is anyone has done the ASP.NET MVC4 workshop course(2 days) from Peers Technologies. Let me know. I need to talk before joining ASP.NET MVC4 training at peers, Hyderabad.
what is the purpose of checked Menu options
whats the use of following Good Coding Practices?
how to stop execution of step 3 in a job mainframe
is possible to delete specific data in a row by using of sql query?
you have an unlimited supply of $3 and $7 poker chips. What is the largest integer value that you cannot make by combining different numbers of chips?
How to display questions one by one in jsp and I wants to store the answers in my database?
What is the merger sort principle and its time complexity.
How do you pass variables forwrd to future CECI sessions
C 
