$T(n)=T(\frac{n}{2})+1$ for binary search

$T(n)=T(n-1) +1$ for linear search.

$T(n)=T(n-1) +1$ for linear search.

The Gateway to Computer Science Excellence

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

50,650 questions

56,192 answers

193,988 comments

94,863 users