To place the caption at the top of the image, you will need to change the __________ in the
2 answers:
You might be interested in
Answer:
The correct answer to the following question will be "Θ(n2)
". The further explanation is given below.
Explanation:
If we're to show all the objects that exist from either the first as well as the second vector, though not all of them, so we'll have to cycle around the first vector, so we'll have to match all the objects with the second one.
So,
This one takes:
=
And then the same manner compared again first with the second one, this takes.
=
Therefore the total complexity,
= Θ(n2)
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.
