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).
Update it so it wont do that
Apps do a single function where applications do multiple functions
Answer:
When I was younger I had a dream about being popular for my studies. everyone knew that I worked hard and devoted to studies. Two years ago I took an admission to a different school, no one knew I studied well how I hittin famous was quite unique. It was hard for students to carry textbooks, a rule was made for textbooks to be in a cupboard. I was the monitor of the cupboard and had keys for it. once in my mathematics class my classmates were shouting my name "SALENA! SALENA! so I would give them there books. maam out of frustration asked "Who is SALENA!? I raised my hand from behind maam in an embarrassed manner. My teacher noticed me and realized I'm a brilliant student.
Explanation:
I hope you have a nice! I tried to shorten it has much as I could. I hope this helps you!