All categories

3 years ago

71 81 77 15 63 96 36 51 77 18 17

Computers and Technology

1 answer:

sp2606 [1]3 years ago

4 0

Answer:

Following are the solution to this question:

Explanation:

This algorithm uses the divide and rule approach works, which splits the list into two sublists depending on if they are smaller or larger than the pivotal factor. It has O(n*log n) complexity.

It splits down the list in more than one version frequently till every sublist becomes based on a single element and fuses it to offer an ordered array. The merge type works according. It has O(n*log n) complexity.

Please find the attachment file of the sorting.

You might be interested in

Blank text has a darker apperance than normal texts

sammy [17]

That's cool, I guess. What was the question?

4 0

3 years ago

Consider the following algorithms. Each algorithm operates on a list containing n elements, where n is a very large integer.

DochEvi [55]

We have that the appropriate statement will be

An algorithm that accesses only the first 10 elements in the list, regardless of the size of the list. Which of the algorithms run in reasonable time

III only.

Option B

From the question we are told

Consider the following algorithms. Each algorithm operates on a list containing n elements, where n is a very large integer.

I. An algorithm that accesses each element in the list twice.

II. An algorithm that accesses each element in the list n times.

III. An algorithm that accesses only the first 10 elements in the list, regardless of the size of the list. Which of the algorithms run in reasonable time?

<h3>Algorithm </h3>

Generally In order to get admission to every thing in the list twice, the algorithm has to traverse the listing twice,

which leads to 2*n entry to operations.

And if the every factor is accessed n times, the listing will be traversed n time, which leads to n^2 get right of entry to operations.

If n is a very giant integer, each 2*n and n^2 are plenty larger.

So, there will be solely ten entry to operations and this algorithm will have a sensible jogging time.

Therefore

An algorithm that accesses only the first 10 elements in the list, regardless of the size of the list. Which of the algorithms run in reasonable time

III only.

Option B

For more information on algorithm visit

brainly.com/question/950632

4 0

2 years ago

What changes the size of a video when played?

Leni [432]

Answer:

D. the browser

Explanation:

it adjusts to the size of your device, including the browser.

hope i helped

8 0

3 years ago

Read 2 more answers

How can you get in touch with someone when they ain't answering you ☹

mixer [17]

You can go to their house and talk to them

3 0

3 years ago

: For each of the following words identify the bytethat is stored at lower memory address and the byte that is storedat higher m

Aloiza [94]

Answer:

In a little endian computer -The data's least substantial byte is put at the lower address byte. The remaining information will be put in memory in order in the next three bytes.

a)1234

4 is placed at the least significant bits,so this byte stored at lower memory address.

1 is placed at the most significant bits,so this byte stored at higher memory address.

b) ABFC

C is placed at the least significant bits,so this byte stored at lower memory address.

A is placed at the most significant bits,so this byte stored at higher memory address.

c) B100

0 is placed at the least significant bits,so this byte stored at lower memory address.

B is placed at the most significant bits,so this byte stored at higher memory address.

d) B800

0 is placed at the least significant bits,so this byte stored at lower memory address.

B is placed at the most significant bits,so this byte stored at higher memory address.

5 0

3 years ago