What is mean by merge sort?
- 1 Answers
- 968 Views
- I also Faced
- E-Mail Answers
Answer / Priyanka Gupta
Merge sort is a divide-and-conquer algorithm used for sorting large lists and arrays. It divides the unsorted list into n sublists, each containing one element, then recursively merges them in sorted order. The key advantage of merge sort is its worst-case time complexity of O(n log n).
| Is This Answer Correct ? | 0 Yes | 0 No |
What are the applications of graph data structure?
State the difference between arrays and linked lists?
Is Linked List 'linear' or 'Non-linear' data structure?
Can arraylist store int?
How many links are there in a binary tree of N nodes?
Which sorting is best for large data?
Can the double-checked locking fail on a single processor system?
What are different techniques for making hash function?
What is huffman’s algorithm?
What is a treemap chart?
Define a binary tree?
How is bubble sort done?
Windows 
