Scribd Logo
Upload

Welcome to Scribd!

  • Binomial Coefficient Growth Rate

    Uploaded by

    vinzklorthos
    43 views1 page
    The document discusses the growth rate of the binomial coefficient C(n, k). It shows that C(n, k) is Θ(n) when k = 1, Θ(n2) when k = 2, and Θ(n3) when k = 3. When k is close to n/2, Stirling's formula implies that C(n, k) is Θ(2n√n), indicating very fast growth as n increases.

    Original Description:

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses the growth rate of the binomial coefficient C(n, k). It shows that C(n, k) is Θ(n) when k = 1, Θ(n2) when k = 2, and Θ(n3) when k = 3. When k is close to n/2, Stirling's formula implies that C(n, k) is Θ(2n√n), indicating very fast growth as n increases.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    43 views1 page

    Binomial Coefficient Growth Rate

    Uploaded by

    vinzklorthos
    The document discusses the growth rate of the binomial coefficient C(n, k). It shows that C(n, k) is Θ(n) when k = 1, Θ(n2) when k = 2, and Θ(n3) when k = 3. When k is close to n/2, Stirling's formula implies that C(n, k) is Θ(2n√n), indicating very fast growth as n increases.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 1

    Growth Rate of the Binomial Coecient

    Hanan Ayad

    Computing C(n, k)

    The number of additions made by the recursive algorithm for computing C(n, k) based on the formula C(n, k) = C(n 1, k 1) + C(n 1, k) is equal to C(n, k) 1, which can be said to be (C(n, k)). But, what is the growth rate of C(n, k)? Specically, how is C(n, k) expressed in terms of the basic asymptotic eciency classes?

    Growth Rate of C(n, k)

    To express the growth rate of C(n, k) in terms of n, we consider the function C(n, k) for dierent values of k. For k = 1, C(n, 1) = n (n). For n = 2, C(n, 2) = For n = 3, C(n, 3) = For n = n , 2 C(n, n/2) =
    n

    n(n 1) (n2 ). 2

    n(n 1)(n 2) (n3 ). 6

    n! (n/2)!

    2.

    Using Stirling formula: n!

    2n

    n e

    2n(n/e)n 2 = 2n (2n n0.5 ) C(n, n/2) = n/2 ]2 [ 2n/2(n/2e) 2n

    , as n , we get,

    (1)

    Equation 1 implies that C(n, k) grows very fast for k close to n/2

    You might also like