Ask a Question

Sort the list of the elements 10,5,7,6,1,4,8,3,2,9 using merge sort algorithm

0 votes
50 views
in Analysis of Algorithm by (98.9k points)
edited
Sort the list of the elements 10,5,7,6,1,4,8,3,2,9 using merge sort algorithm and   show its computing time is O(n logn).  Merge sort 10, 5, 7, 6, 1, 4, 8, 3, 2, 9

Your answer

Please answer the question in detail
Your name to display (optional):
Privacy: Your email address will only be used for sending these notifications.
Anti-spam verification:
To avoid this verification in future, please log in or register.

Related questions

Doubtly is an online community for engineering students, offering:

  • Free viva questions PDFs
  • Previous year question papers (PYQs)
  • Academic doubt solutions
  • Expert-guided solutions

Get the pro version for free by logging in!

Most popular tags

jeemain geography-10th engineering physics semester 5 web computing

5.7k questions

5.1k answers

108 comments

557 users

Doubtly
...