bro ,how can i learn abt Recurrence relations,plz suggest sm books or online material -thanku

The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

+2 votes

The solution of the reccurence relation

$T(n) \leq \begin{cases} \theta(1) & \text{ if } n \leq 80 \\ T(\frac{n}{s})+T(\frac{7n}{10}+6)+O(n) & \text{ if } n> 80 \end{cases}$ is

- O(lg n)
- O(n)
- O(n lg n)
- None of the above

- All categories
- General Aptitude 1.8k
- Engineering Mathematics 7.3k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.1k
- Non GATE 1.6k
- Others 1.8k
- Admissions 595
- Exam Queries 576
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 17

50,362 questions

55,788 answers

192,413 comments

90,925 users