big o - Complexity of factorial recursive algorithm -

-

today in class teacher wrote on blackboard recursive factorial algorithm:

int factorial(int n) {    if (n == 1)         return 1;    else         return n * factorial(n-1); }

she said has cost of t(n-1) + 1.

then iteration method said t(n-1) = t(n-2) + 2 = t(n-3) + 3 ... t(n-j) + j, algorithm stops when n - j = 1, j = n - 1.

after that, substituted j in t(n-1) + 1, , obtained t(1) + n-1.

she directly said n-1 = 2(log2n-1), cost of algorithm exponential.

i lost last 2 steps. can please explain them me?

let's start off analysis of algorithm. can write recurrence relation total amount of work done. base case, 1 unit of work when algorithm run on input of size 1, so

t(1) = 1

for input of size n + 1, algorithm 1 unit of work within function itself, makes call same function on input of size n. therefore

t(n + 1) = t(n) + 1

if expand out terms of recurrence, that

  • t(1) = 1
  • t(2) = t(1) + 1 = 2
  • t(3) = t(2) + 1 = 3
  • t(4) = t(3) + 1 = 4
  • ...
  • t(n) = n

so in general algorithm require n units of work complete (i.e. t(n) = n).

the next thing teacher said that

t(n) = n = 2log2 n

this statement true, because 2log2x = x nonzero x, since exponentiation , logarithms inverse operations of 1 another.

so question is: polynomial time or exponential time? i'd classify pseudopolynomial time. if treat input x number, runtime indeed polynomial in x. however, polynomial time formally defined such runtime of algorithm must polynomial respect number of bits used specify input problem. here, number x can specified in θ(log x) bits, runtime of 2log x technically considered exponential time. wrote length in this earlier answer, , i'd recommend looking @ more thorough explanation.

hope helps!


Comments

Post a Comment

Popular posts from this blog

c++ - Function signature as a function template parameter -

-
i'd use function signature template argument. works great classes, when try same trick function templates, msvc throws error: error c2768: 'func' : illegal use of explicit template arguments here's code: template <typename signature> void func(); template <typename r, typename a1> void func<r(a1)>(); what should make work? you cannot partially specialize function template, not supported language. can create partially specialized class template static member function, , possibly trampoline function instantiate class template , invoke static function. something this: namespace detail { template<typename signature> struct helper; template<typename r, typename a1> struct helper<r(a1)> { static void call() { // stuff r , a1... } }; } template<typename signature> void func() { detail::helper<signature>::call(); }
Read more

algorithm - What are some ways to combine a number of (potentially incompatible) sorted sub-sets of a total set into a (partial) ordering of the total set? -

-
i have sorting problem i'm pretty sure doesn't have canonical "answer" - has number of different approaches, each pros/cons. i'm interested in hearing different approaches. suppose bunch of people {p_i | i=1,...,m} ranking favorite ice cream flavors. in total there n different flavors, single person p_i ranks n_i << n flavors or familiar with. i'm interested in combining these sub-rankings plausible overall ranking of n flavors. for concrete situation: m , n both 1000 (by coincidence), , each n_i 20 . can assume there's enough overlap in flavors people rank such no flavor "isolated". again, i'm interested in hearing different ways approach this, if there isn't single clear answer. thanks! one way approach problem construct directed cyclic graph representing of constraints on ordering of elements. nodes in graph represent different elements compared , have edge first node second node if had ranked first e...
Read more

How to call a javascript function after the page loads with a chrome extension? -

-
there's function on page want call after loads. not own page, can't insert html it. can please provide specific examples how chrome extension or greasemonkey? (function submitaction() ). both chrome extensions , greasemonkey offer ways specify when script inject if executed. in chrome extension, you set in manifest : "content_scripts": [ { "run_at" : "document_idle", in greasemonkey compatible userscripts, set in metadata // @run-at document-end in both cases, have add script if want ensure resources loaded when function executed : document.addeventlistener('load', submitaction);
Read more