- #1

- 467

- 0

If the algorithm recurrence can be shown to belong to something complicated say like

T(n) = log_{3/2} n lg(n) + (log_{3/2}(n) (log_{3/2}(n) - 1 ) /2) lg(2/3)

What order of complexity can I expect it to be in?

- Thread starter zeion
- Start date

- #1

- 467

- 0

If the algorithm recurrence can be shown to belong to something complicated say like

T(n) = log_{3/2} n lg(n) + (log_{3/2}(n) (log_{3/2}(n) - 1 ) /2) lg(2/3)

What order of complexity can I expect it to be in?

- #2

- 129

- 0

In the order of the dominant term. So the term that is going to matter most when n is large.

- Replies
- 3

- Views
- 4K

- Replies
- 2

- Views
- 5K

- Last Post

- Replies
- 1

- Views
- 561

- Replies
- 4

- Views
- 8K

- Replies
- 9

- Views
- 803

- Replies
- 13

- Views
- 1K

- Replies
- 1

- Views
- 4K

- Replies
- 4

- Views
- 1K

- Replies
- 1

- Views
- 460

- Last Post

- Replies
- 11

- Views
- 9K