Question

Any fastest algorithm for $f(n) = f(n-1) \cdot f(n-2)$ where $3 \leq n \leq 1000000$

score 276 · Answer 1 · 2012-07-03 09:07:40

276

Views

Any fastest algorithm for $f(n) = f(n-1) \cdot f(n-2)$ where $3 \leq n \leq 1000000$

Published on 03 Jul 2012 - 9:07

score 151 · Answer 2 · 2012-07-10 08:20:39

151

Views

Help on Generating function - Analysis of Median of three - Quick Select

Published on 10 Jul 2012 - 8:20

score 532 · Answer 3 · 2012-07-15 19:56:39

532

Views

$\mu$-recursive definition of ulam (3n+1) function

Published on 15 Jul 2012 - 19:56

score 317 · Answer 4 · 2012-07-16 17:36:32

317

Views

Solving Recurrence $T_n = T_{n-1}*T_{n-2} + T_{n-3}$

Published on 16 Jul 2012 - 17:36

score 778 · Answer 5 · 2012-07-16 21:33:01

778

Views

google page rank algorithm with range of values

Published on 16 Jul 2012 - 21:33

score 4.3k · Answer 6 · 2012-07-18 12:07:18

4.3k

Views

Ulam's problem - guessing a chosen number in a set

Published on 18 Jul 2012 - 12:07

score 92 · Answer 7 · 2012-07-28 05:35:01

92

Views

Does this sequence of operators in Hilbert space, given by an algorithm, terminate

Published on 28 Jul 2012 - 5:35

score 219 · Answer 8 · 2012-07-30 08:03:46

219

Views

In mathematics, what is meant by induction?

Published on 30 Jul 2012 - 8:03

score 16.7k · Answer 9 · 2012-08-03 12:09:53

16.7k

Views

What will the recursion tree of Fibonacci series look like?

Published on 03 Aug 2012 - 12:09

score 2.9k · Answer 10 · 2012-08-03 17:01:54

2.9k

Views

Why does Strassen's algorithm work for $2\times 2$ matrices only when the number of multiplications is $7$?

Published on 03 Aug 2012 - 17:01

score 1.3k · Answer 11 · 2012-08-04 16:23:52

1.3k

Views

Karatsuba Multiplication

Published on 04 Aug 2012 - 16:23

score 30.6k · Answer 12 · 2026-03-27 05:56:15

30.6k

Views

Worst case analysis of MAX-HEAPIFY procedure .

Published on 27 Mar 2026 - 5:56

score 4.1k · Answer 13 · 2026-03-25 20:35:25

4.1k

Views

What is the lower bound and upper bound on time for inserting n nodes into a binary search tree?

Published on 25 Mar 2026 - 20:35

score 116 · Answer 14 · 2012-08-31 01:33:53

116

Views

Proving that an effective procedure is correct

Published on 31 Aug 2012 - 1:33

score 356 · Answer 15 · 2012-09-05 09:37:02

356

Views

Finding $a_n$ for very large $n$ where $a_n = a_{n-1} + a_{n-2} + a_{n-3} + 2^{n-3} $

Published on 05 Sep 2012 - 9:37

List Question

Any fastest algorithm for $f(n) = f(n-1) \cdot f(n-2)$ where $3 \leq n \leq 1000000$

Help on Generating function - Analysis of Median of three - Quick Select

$\mu$-recursive definition of ulam (3n+1) function

Solving Recurrence $T_n = T_{n-1}*T_{n-2} + T_{n-3}$

google page rank algorithm with range of values

Ulam's problem - guessing a chosen number in a set

Does this sequence of operators in Hilbert space, given by an algorithm, terminate

In mathematics, what is meant by induction?

What will the recursion tree of Fibonacci series look like?

Why does Strassen's algorithm work for $2\times 2$ matrices only when the number of multiplications is $7$?

Karatsuba Multiplication

Worst case analysis of MAX-HEAPIFY procedure .

What is the lower bound and upper bound on time for inserting n nodes into a binary search tree?

Proving that an effective procedure is correct

Finding $a_n$ for very large $n$ where $a_n = a_{n-1} + a_{n-2} + a_{n-3} + 2^{n-3} $

Trending Questions

Popular # Hahtags

Popular Questions