Data Structures

Big-0 Part 1 Assume that each of the expressions below gives the processing time T(n) spent by an algorithm for solving a problem of size n. Specify the Big-O complexity of each algorithm. 1.75 1. 5 +0.001n3 + 0.025n 2. 500n + 100nl.5 + 50n log10 n 3. 0.3n + 5n1.5 + 2.5 .n 4. n? log, n+ n(log, n)? 5. n log; n + n log, n 6. 3 logg n + log, log, log, n 7. 100n + 0.01n? 8. 0.01n + 100n2 9. 2n + n0.5 + 0.5n1.2 10. 0.01n log, n + n(log, n)? 11. 100n log; n+ n + 100n 12. 0.003 log n + log, log2 n 13. log(10) + log(202)