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"
Bookmarks inbookmarks:mine
inbookmarks: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 61210

Questions about the science and art of determining properties of algorithms, often including correctness, runtime and space usage. Use the [runtime-analysis] tag for questions about the runtime of algorithms.

1
vote
1answer
The increasing order of following functions in terms of asymptotic complexity is: (A) f1(n) < f4(n) < f2(n) < f3(n) (B) f1(n) < f2(n) < f3(n) < f4(n) (C) f2(n) < f1(n) < f4(n) < f3(n) (D) f1(n) < …
asked Nov 10 '16 by WarWithSelf