Member Avatar for corby
corby -4 Junior Poster

ok so if T(1) = 3 and
T(n) = T(n-1) +2n -3, n > 1
how do i solve for T(n) and how do i then prove it with the verification, inductive hypothesis, and inductive step?

same thing for
T(1) = 1
T(n) = T(n/2) + bn(logn) where b is a constant
(this one deals with domain transformation)

  • 1 Contributor
  • 0 Replies
  • 70 Views
Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.