Question

limit of $f_n(a) = a^{f_{n-1}(a)}$ as $n$ approaches infinity for small values of $a$

score 123 · Answer 1 · 2014-09-09 23:08:53

123

Views

limit of $f_n(a) = a^{f_{n-1}(a)}$ as $n$ approaches infinity for small values of $a$

Published on 09 Sep 2014 - 23:08

score 359 · Answer 2 · 2014-09-11 06:11:28

359

Views

Quicksort probabilistic analysis

Published on 11 Sep 2014 - 6:11

score 80 · Answer 3 · 2014-09-11 09:35:51

80

Views

How to solve the recursive complexity?

Published on 11 Sep 2014 - 9:35

score 1.5k · Answer 4 · 2014-09-13 16:56:02

1.5k

Views

Big O complexity of the partition function derived from this code?

Published on 13 Sep 2014 - 16:56

score 17.3k · Answer 5 · 2014-09-13 18:49:51

17.3k

Views

Tight asymptotic upper and lower bounds

Published on 13 Sep 2014 - 18:49

score 772 · Answer 6 · 2014-09-17 17:04:55

772

Views

Can this recursive summation function be simplified?

Published on 17 Sep 2014 - 17:04

score 48 · Answer 7 · 2014-09-17 20:43:11

48

Views

recursive sequence - Which approach can I take to solve this equation?

Published on 17 Sep 2014 - 20:43

score 383 · Answer 8 · 2026-03-25 12:24:46

383

Views

Is there a simplification for the coefficients generated with the Mandelbrot iteration rule?

Published on 25 Mar 2026 - 12:24

score 56 · Answer 9 · 2014-09-19 18:34:15

56

Views

Question about Growth Rates

Published on 19 Sep 2014 - 18:34

score 86 · Answer 10 · 2014-09-20 21:14:43

86

Views

Recurrence Relation

Published on 20 Sep 2014 - 21:14

score 513 · Answer 11 · 2014-09-21 17:54:31

513

Views

Algorithms recurrence equation using unwinding / substitution

Published on 21 Sep 2014 - 17:54

score 490 · Answer 12 · 2014-09-21 19:11:41

490

Views

Using a Recursion Tree to solve the recurrence $T(n) = \sqrt n T(\frac{n}{2}) + 10n$?

Published on 21 Sep 2014 - 19:11

score 76 · Answer 13 · 2014-09-21 20:14:45

76

Views

How can I solve the particular solution of the following recurrence (recursive) relation?

Published on 21 Sep 2014 - 20:14

score 531 · Answer 14 · 2014-09-22 21:18:59

531

Views

Finding a tight upper-bound on $T(n) = 3T(\frac{2}{3}n)$

Published on 22 Sep 2014 - 21:18

score 31.1k · Answer 15 · 2026-02-23 04:37:09

31.1k

Views

Algorithm to calculate rating based on multiple reviews (using both review score and quantity)

Published on 23 Feb 2026 - 4:37

List Question

limit of $f_n(a) = a^{f_{n-1}(a)}$ as $n$ approaches infinity for small values of $a$

Quicksort probabilistic analysis

How to solve the recursive complexity?

Big O complexity of the partition function derived from this code?

Tight asymptotic upper and lower bounds

Can this recursive summation function be simplified?

recursive sequence - Which approach can I take to solve this equation?

Is there a simplification for the coefficients generated with the Mandelbrot iteration rule?

Question about Growth Rates

Recurrence Relation

Algorithms recurrence equation using unwinding / substitution

Using a Recursion Tree to solve the recurrence $T(n) = \sqrt n T(\frac{n}{2}) + 10n$?

How can I solve the particular solution of the following recurrence (recursive) relation?

Finding a tight upper-bound on $T(n) = 3T(\frac{2}{3}n)$

Algorithm to calculate rating based on multiple reviews (using both review score and quantity)

Trending Questions

Popular # Hahtags

Popular Questions