Computer Science, asked by sumanthdeshagani2002, 6 months ago

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 log n)

Answers

Answered by saiommnayak55

4

Answer:

kkxkzjdjdkdkdjdjdbdbdbdb

Explanation:

loxjznzndbdbdndndbbrvfvffhfhfhfhfh gf fhfhfhfh

Previous Question

Next Question

Similar questions

Business Studies, 3 months ago

What is the life blood of every business enterprise? a) Finance b) Cash c) Government d) Owner...

Math, 3 months ago

find the roots by factorization ${2x}^{2} + x - 6 = 0$ ...

Hindi, 3 months ago

अंकुर की रुचि किसमें थी...

Physics, 6 months ago

Ting Tong! Question: Refer to the attachment. _________... (Physics)...

History, 6 months ago

WHICH TERM IS CALLED THEREBIRTH OF ART AND LEARNING WHICH USED TO DESCRIBE A TIME WHEN THERE IS A GREAT CREATIVE ACTIVITY...

Math, 10 months ago

Pls help me to get the value of x In the following question...

Math, 10 months ago

rupees 18750 is invested by a man in the bank account of his two sons whose edges are 12 years and 14 years in such a way that they will get equal amount of the age of 18 years at the rate 5% per annum the share of youngest child was...

Math, 10 months ago

The price of a dozen pencil is rs. 72.find the cost of 18 pencils...