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 90585
Questions about asymptotic notations and analysis
0
votes
1
answer
37
views
Proof the recurrence relation of order statistics using induction
I read order statistics from the book The Design and Analysis of Computer Algorithms", by Aho, Hopcroft, Ullman, Addison-Wesley
As per the algorithm the recurrence relation given
T(n)<= cn for n<=49 . …
- 165
0
votes
1
answer
94
views
Give an O(n^2) algorithm to solve
This is my homework question
Given an array A[1..n] of n integers, we want to decide if there exist i and j, where 1 ≤ i , j ≤ n, such that
A[i] + A[j] = α for a given value α.
Give an O(n^2) algorit …
- 165