Java Programming

Announcement

For appeals, questions and feedback about Oracle Forums, please email oracle-forums-moderators_us@oracle.com. Technical questions should be asked in the appropriate category. Thank you!

calculating big O complexity, coding example

807603Oct 20 2007 — edited Oct 20 2007

hi, from that complexity, i gotta create a code that illustrates the time complexity, worst case O(F(N)).
Knowing that the complexity T(N) is defined as follows:

T(N) = b if N <= 2
T(N) = 7 * T(N/2) + a * N * N if N > 2

Here, a and b are constants. what would be O(T(N)), and how could it be coded as an example, pretty please?
I got no clue where to start! lil hint plz
ty.

Locked Post

New comments cannot be posted to this locked post.

Locked on Nov 17 2007

Added on Oct 20 2007

1 comment

189 views