Use Big-O notation to express the time efficiency of the following algorithm:

𝑇(𝑁) = 788 ∗ 𝑁2 log 𝑁 + 100001 + 2𝑁3 + 3585789

asked by guest
on Jan 10, 2025 at 10:13 am



Mathbot Says...

I wasn't able to parse your question, but the HE.NET team is hard at work making me smarter.


+ Submit Question