Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with asymptotics
Search options not deleted
user 53921
Questions about asymptotic notations and analysis
0
votes
0
answers
895
views
Understanding time complexity of dynamic array implementation of stack
let me tell you first what is written in the book I am following.
If the array is full,create a new array of twice the size, and copy items.
At n=1,we do 1 copy operation,at n=2,we do 2 copy operatio …
3
votes
2
answers
4k
views
Time complexity of the fast exponentiation method
I am trying to analyse the time complexity of the fast exponentiation method,
which is given as
$$x^n=
\begin{cases}
x^\frac{n}{2}.x^\frac{n}{2} &\text{if n is even}\newline
x.x^{n-1} &\tex …
5
votes
3
answers
1k
views
Solving recurrence relation $T(n)=\sqrt{n} \cdot T(\sqrt{n}) + n$ using method of guessing a...
The book I am following explains the solution as,
As we can see,the size of sub problems at the first level of recursion
is $n$.So, let us guess that $T(n)=O(n\log n)$ and try to prove that our …
2
votes
3
answers
308
views
Asymptotic equivalent of the recurrence T(n)=3⋅T(n/2)+n
The questions is to find the running time $T(n)$ of the following function:
$$T(n)=3\cdot T(n/2) + n \tag{1}$$
I know how to solve it using Master theorem for Divide and Conquer but I am trying to s …
1
vote
1
answer
67
views
How do I find running time for the following divide and conquer problem?
Question is to find the runtime $T(n)$ of following problem by solving the recurrence.
$T(n)=16\cdot T(\frac{n}{4}) + n!$.
I went through the following theory.
If the recurrence relation is of the …