Answer:
cross
bc im religous and stuff (0_0)
Answer:
c.O(n)
Explanation:
In the array based list implementation of the ADT the worst case time complexity of the getEntry method is O(n).In the worst case it has to travel upto n elements then it has to do the operation.In doing so the time complexity will come out to be O(n).So we conclude that the answer to this question is O(n).
create a report that displays back tge total sales by country
Answer:
int age = 10;
switch (age){
case 0:
case 1:
System.out.println("ineligible");
break;
case 2:
System.out.println("toddler");
break;
case 3:
case 4:
case 5:
System.out.println("early childhood");
break;
case 6:
case 7:
System.out.println("young reader");
break;
case 8:
case 9:
case 10:
System.out.println("elementary");
break;
case 11:
case 12:
System.out.println("middle");
break;
case 13:
System.out.println("impossible");
break;
case 14:
case 15:
case 16:
System.out.println("high school");
break;
case 17:
case 18:
System.out.println("scholar");
break;
default:
System.out.println("ineligible");
}
Explanation:
In java and many other programming languages, a switch statement is a way of having multiple branching options in a program. This is usually considered a more efficient way than using multiple if....else if statements. and the expression variables could be byte, char int primitive data types. etc. every branch (option) in a switch statement is followed by the break statement to prevent the code from "falling through". In the question The variable age is declared as an int and initialized to 10. and tested against the conditions given in the question.
