Answer:
It's A. a CompTIA certificate and D. a Microsoft-certified desktop support
certificate
Explanation:
I got it right.
In an if...else statement, if the code in the parenthesis of the if statement is true, the code inside its brackets is executed. But if the statement inside the parenthesis is false, all the code within the else statement's brackets is executed instead.
Of course, the example above isn't very useful in this case because true always evaluates to true. Here's another that's a bit more practical:
#include <stdio.h>
int main(void) {
int n = 2;
if(n == 3) { // comparing n with 3 printf("Statement is True!\n");
}
else { // if the first condition is not true, come to this block of code
printf("Statement is False!\n"); } return 0;
}
Output:
Statement is False!
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.