Computer Science, asked by 2021reshi, 6 hours ago

1) What is the asymptotic cost of looking up a key in a table by direct access?
A)O(1)
B)O(logn)
C)O(nlogn)
D)O(n)

Answers

Answered by artirawat930
2

Answer:

O(1).

Explanation:

The answer is O(1)

Answered by kraditya050
2

Answer:

O(1)

first option is correct

I hope it's helpful to you ✌️✌️✌️✌️

Similar questions