Answer:
Open loop control systems.
Closed loop control systems.
Explanation:
Answer:
1 2 3 4 5 6 7 8 End
Explanation:
int i = 1;
while (i != 9){
System.out.print (i + " ");
i ++;
if (i == 9){
System.out.println("End");
}
}
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:
You entered number two
Explanation:
Because even though it is greater than 0, it already has a set function in place.
