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
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Favorites infavorites:mine
infavorites:1234
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 Search options user 9343

An algorithm is a sequence of well-defined steps that defines an abstract solution to a problem. Use this tag when your issue is related to design and analysis of algorithms.

0
votes
3answers
I am confusing with the following example. $n^{1.001} + n\log n = \Theta ( n^{1.001} )$, why not $n\log n$? $c_1 \le \frac{\log n}{n^{0.001}} \le c_2 $ OR $c_1\le \frac{n^{0.001}}{\log n} \le c_2 …
asked Jul 26 '13 by user1745866
-1
votes
1answer
What is the asymptotic runtime of fthe ollowing piece of code in terms of number of updates to S in worst case. Void foo( int n) { int S = 0; for ( i=1 ; i<= n ; i++) { …
asked Oct 14 '14 by user1745866
2
votes
2answers
In the following function, let $n \geq m$. int gcd(n,m) { if (n % m == 0) return m; n = n % m; return gcd(m, n); } How many recursive calls are made by this function? $\Theta (\log …
asked Aug 15 '13 by user1745866