Ask
Login
0
2.6kviews
Explain merge sort algorithm. Sort the following numbers with merge sort give output of each path
written 7.9 years ago by gravatar for satishmanje93 satishmanje93 • 250 modified 3.8 years ago by gravatar for Krishna_Agrawal Krishna_Agrawal • 2.7k

Subject: Analysis Of Algorithm

Topic: Divide Aqnd Conquer

Difficulty: Medium

Explain merge sort algorithm. Sort the following numbers with merge sort give output of each path

84, 25, 36, 15, 48, 09, 17, 55, 92 , 36
analysis of algorithms
ADD COMMENT EDIT
1 Answer
0
39views
written 3.8 years ago by gravatar for Krishna_Agrawal Krishna_Agrawal • 2.7k

Merge Sort :-

  1. Merge sort is one of the most efficient sorting algorithms.

  2. Merge sort is a sorting technique based on divide and conquer technique.

  3. With worst-case time complexity being Ο(n log n), it is one of the most respected algorithms.

  4. Merge sort first divides the array into equal halves …

Create a free account to keep reading this post.

and 3 others joined a min ago.

ADD COMMENT EDIT
Please log in to add an answer.