Question: The order of an algorithm that decrements every element in a three-dimensional table of N rows. 1. O(1) 2. O(logN) 3. O(N) 4. O(N logN)
The order of an algorithm that decrements every element in a three-dimensional table of N rows. 1. O(1) 2. O(logN) 3. O(N) 4. O(N logN) 5. O(N*N) 6. O(N*N*N)
Step by Step Solution
There are 3 Steps involved in it
The operation of decrementing every element in a threedi... View full answer
Get step-by-step solutions from verified subject matter experts
