Question

Does the multiplication of the recursive calls affect the master's theorem?

score 76 · Answer 1 · 2023-12-21T01:13:26.080000

76

Views

Does the multiplication of the recursive calls affect the master's theorem?

Published on 21 December 2023 at 01:13

score 154 · Answer 2 · 2023-10-25T16:50:35.457000

154

Views

Time complexity of mixedsort (a modification on bubblesort)

Published on 25 October 2023 at 16:50

score 18 · Answer 3 · 2023-10-05T04:00:57.197000

18

Views

Master Theorem - Solving Recurrence

Published on 05 October 2023 at 04:00

score 40 · Answer 4 · 2023-07-17T01:58:28.097000

40

Views

Is my application of master theorem correct?

Published on 17 July 2023 at 01:58

score 209 · Answer 5 · 2023-01-30T10:26:00.213000

209

Views

Recurrence Relation: Solve T(n) = 25T(n/5) + ((n log 5) / (log n))^2

Published on 30 January 2023 at 10:26

score 587 · Answer 6 · 2022-12-01T18:18:38.847000

587

Views

What exactly does epsilon represent in master theorem?

Published on 01 December 2022 at 18:18

score 30 · Answer 7 · 2022-11-13T22:51:46.047000

30

Views

Determining if case 2 applies of the Master Theorem when a=1, b=2, f(n) = logn

Published on 13 November 2022 at 22:51

score 212 · Answer 8 · 2022-10-29T22:07:31.400000

212

Views

Average-case time complexity of QuickSort algorithm

Published on 29 October 2022 at 22:07

score 528 · Answer 9 · 2022-05-23T19:13:20.640000

528

Views

Solve the recurrences, T(n)=3T(n - 1)+3

Published on 23 May 2022 at 19:13

score 147 · Answer 10 · 2022-03-24T20:58:57.240000

147

Views

Solving recurrence of divide and conquer using master theorem

Published on 24 March 2022 at 20:58

score 100 · Answer 11 · 2022-02-28T02:15:30.407000

100

Views

what would be the run time of this function using master's theorem

Published on 28 February 2022 at 02:15

score 284 · Answer 12 · 2022-02-09T09:03:35.050000

284

Views

Can T(n) = 2T(n/4)+ n^3 + n^2 be solved using Master Theorem?

Published on 09 February 2022 at 09:03

score 65 · Answer 13 · 2022-01-11T01:11:04.747000

65

Views

Computational complexity and recursion - Is this analysis correct?

Published on 11 January 2022 at 01:11

score 2.2k · Answer 14 · 2021-12-21T20:54:06.847000

2.2k

Views

Time complexity of T(n) = 27T(n/3) + (n^3)log(n)

Published on 21 December 2021 at 20:54

score 45 · Answer 15 · 2021-12-14T04:41:43.650000

45

Views

Finding the recursive relation of an algorithm and then using to find the runtime complexity using the master theorem

Published on 14 December 2021 at 04:41

score 83 · Answer 16 · 2021-12-05T17:18:06.033000

83

Views

Solve Recurrence relation using master theorem method

Published on 05 December 2021 at 17:18

score 381 · Answer 17 · 2021-11-22T19:21:23.837000

381

Views

How to find the recurrence relation, and calculate Master Theorem of a Merge Sort Code?

Published on 22 November 2021 at 19:21

score 261 · Answer 18 · 2021-11-09T10:55:13.220000

261

Views

How to apply master theorem of 2 binary search?

Published on 09 November 2021 at 10:55

score 241 · Answer 19 · 2021-11-08T18:14:16.650000

241

Views

3 Recursions to Recurrence T(n) and Master Theorem

Published on 08 November 2021 at 18:14

score 150 · Answer 20 · 2021-11-07T02:37:08.403000

150

Views

How to Solve: T(n) = 2 T(n/4) + T(n/4) + T(n/4) + 311 via The Master Theorem?

Published on 07 November 2021 at 02:37

List Question

Does the multiplication of the recursive calls affect the master's theorem?

Time complexity of mixedsort (a modification on bubblesort)

Master Theorem - Solving Recurrence

Is my application of master theorem correct?

Recurrence Relation: Solve T(n) = 25T(n/5) + ((n log 5) / (log n))^2

What exactly does epsilon represent in master theorem?

Determining if case 2 applies of the Master Theorem when a=1, b=2, f(n) = logn

Average-case time complexity of QuickSort algorithm

Solve the recurrences, T(n)=3T(n - 1)+3

Solving recurrence of divide and conquer using master theorem

what would be the run time of this function using master's theorem

Can T(n) = 2T(n/4)+ n^3 + n^2 be solved using Master Theorem?

Computational complexity and recursion - Is this analysis correct?

Time complexity of T(n) = 27T(n/3) + (n^3)log(n)

Finding the recursive relation of an algorithm and then using to find the runtime complexity using the master theorem

Solve Recurrence relation using master theorem method

How to find the recurrence relation, and calculate Master Theorem of a Merge Sort Code?

How to apply master theorem of 2 binary search?

3 Recursions to Recurrence T(n) and Master Theorem

How to Solve: T(n) = 2 T(n/4) + T(n/4) + T(n/4) + 311 via The Master Theorem?

Trending Questions

Popular # Hahtags

Popular Questions