My guess is d but I’m not positive
It depends on what algorithm you’re using.
If you’re going item by item, you’ll be looking at O(n) or O(40000)
Give me a reply if you want to know more, such as if you did binary search what the Big O notation is
Answer:
Antelope Baboon Cheetah Elephant Giraffe, first, then it would search Warthon then Okapi, the manner of a binary search essentially splits the list in half and goes from right to left and then does the same to the other side.
Explanation:
Answer:
n = int(input("Enter the n (positive odd integer): "))
for i in range(1, n+1, 2):
print(i*"*")
for i in range(n-2, 0, -2):
print(i*"*")
Explanation:
*The code is in Python.
Ask the user to enter the n
Create a for loop that iterates from 1 to n, incrementing by 2 in each iteration. Print the corresponding number of asterisks in each iteration
Create another for loop that iterates from n-2 to 1, decrementing by 2 in each iteration. Print the corresponding number of asterisks in each iteration
