0 0 votes Which of the following correctly describes the recurrence relation for the standard binary search algorithm on a sorted array of $\mathrm{n}$ numbers where $\mathrm{c}$ is a constant. $\mathrm{T}(\mathrm{n})=2 ^{*} \mathrm{~T}(\mathrm{n} / 2)+\mathrm{c}$ $\mathrm{T}(\mathrm{n})=\mathrm{T}(\mathrm{n} / 2)$ $\mathrm{T}(\mathrm{n})=\mathrm{T}(\mathrm{n}-1)+\mathrm{c}$ $\mathrm{T}(\mathrm{n})=\mathrm{T}(\mathrm{n} / 2)+\mathrm{c}$ Others gateda-sample-paper-2024 + – admin 2.1k views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
0 0 votes D AnirudhPraveen answered Oct 31, 2023 AnirudhPraveen comment Share Follow 0 reply Please log in or register to add a comment.
0 0 votes The correct recurrence relation for the standard binary search algorithm on a sorted array of n numbers is: T(n) = T(n/2) + c rajveer43 answered Jan 5, 2024 rajveer43 comment Share Follow 0 reply Please log in or register to add a comment.