Answer:
power on, connect to internet, download games
<span>D. Make changes to your code
Variables allow the ability to easily substitute numbers for other numbers.
</span>
The notation would be O (n-1) because there would be no need to compare with the first bit however this notation is most commonly noted as O (n) but the first is also technically correct
Answer:
(a) What is the best case time complexity of the algorithm (assuming n > 1)?
Answer: O(1)
(b) What is the worst case time complexity of the algorithm?
Answer: O(n^4)
Explanation:
(a) In the best case, the if condition will be true, the program will only run once and return so complexity of the algorithm is O(1)
.
(b) In the worst case, the program will run n^4 times so complexity of the algorithm is O(n^4).
Answer and Explanation:
Using JavaScript:
/* program should take N input which represents the dollar amount and output how many chocolate bars and how many coupons we have*/
function chocolatebar(dollars){
var dollaramt= dollars;
var i;
for(i=0; i <= dollaramt; i++){
i=i+6
?
Alert ("you have 1 extra chocolate bar");
:
Alert ("keep buying chocolate bars to get more coupons for a bonus chocolate bar")
}
}
*
