Question: data structures The Big-O notation of time complexity T(n)=(2000 n3 + 2n ! +10n + 7n log n+5) will be OA. O(n log n) OB.
The Big-O notation of time complexity T(n)=(2000 n3 + 2n ! +10n + 7n log n+5) will be OA. O(n log n) OB. O(n) Ocon) OD O(n!)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
