Respuesta :
Answer:
The summary including its given problem is outlined in the following section on the interpretation.
Explanation:
That's not entirely feasible, since at least n similarities have to be made to order n quantities. Find the finest representation where the numbers of 1 to 10 have already been arranged.
⇒ 1 2 3 4 5 6 7 8 9 10
Let's say that we identify one figure as the key then compared it towards the numbers across the left. Whether the correct number is greater, therefore, left number, are doing nothing to switch the location elsewhere.
Because although the numbers have already been categorized 2 has always been compared to 1 which would be perfect, 3 becomes especially in comparison to 2 and so much more. This should essentially take 9 moves, or nearly O(n) moves.
If we switch that little bit already
⇒ 1 3 2 4 5 6 7 8 9 10
3 Is contrasted with 1. 2 will indeed be matched against 3 as well as 2. Since 2 has indeed been exchanged, it must, therefore, be matched with 1 as there might be a case whereby each number z exchanged is greater than the number Y as well as the quantity X < Y.
- X = 1,
- Y = 3, and
- Z = 2.
Only one adjustment expanded the steps which culminated in n+1.
It should be noted that it won't be possible because at least n similarities have to be made to order n quantities.
From the information given, it should be noted that it's not possible for the engineer to implement an algorithm that can sort n elements (e.g., numbers) in fewer than n steps.
This is because there are at least n similarities have to be made to order n quantities. In this case, the numbers of 1 to 10 have already been arranged. When a number is greater, it should be noted that the left number will do nothing to switch the location elsewhere.
Therefore, the information given by the engineer isn't feasible.
Learn more about algorithms on:
https://brainly.com/question/24953880
