Hi guys, I'm preparing for my exams and have been stuck at this problem for a while now, i know my maths is really poor, would really appreciate some pointers.
if algorithm A is of O(2n^3) and algorithm B is of O(2^n + n^2) and if A is guaranteed to solve a problem of size n = 20 in 1 hr, then what problem size could you solve with a machine 8 times as fast? Also, how do i show that B is of O(2^n)? Thanks so much folks. thanks. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
