Answer:
4 5 6
Explanation:
Since there is a do-while loop, you need to check the values for each iteration until the condition (Count <= X) is not satisfied.
First iteration -> Count = 1 and X = 3, Y = 1 + 3, Write Y -> 4
Second iteration -> Count = 2 and X = 3, Y = 2 + 3, Write Y -> 5
Third iteration -> Count = 3 and X = 3, Y = 3 + 3, Write Y -> 6
After the third iteration count is equal to 4 and X is equal to 3. That is why loop ends.
Answer:
Reveal formating- A
Clear formatting-B
Apply formatting of the surrounding text-D
Format painter-C
Explanation:
Answer:
b. selection sort
b. 8 11 17 30 20 25
Explanation:
The options above are the correct answers to the given questions.
Selection sort is a simple comparison-based sorting algorithm.
selection sort. (algorithm) Definition: A sort algorithm that repeatedly searches remaining items to find the least one and moves it to its final location. The run time is Θ(n²), where n is the number of elements. The number of swaps is O(n).
It is this sorting algorithm that will best ne suitable in the given event.
Answer:
D. Identify the problem.
Explanation:
The five steps are -
- Understanding the problem
- Select any alternative way to solve a problem
- Select the best way to solve a problem from the list of alternative solutions.
- List the instructions to solve the problem using the selected solution and evaluate the solution .
Identify the problem - This is the first steps towards solving a given problem. One must properly comprehend what exactly the challenge is.
when 2 people answer your question, the brainliest button will appear in the spot of the thanks button
Hope This Helps! Have A Nice Day!!
