0 votes 0 votes The running time of an algorithm $T(n),$ where $’n’$ is the input size , is given by $T(n) = 8T(n/2) + qn,$ if $n>1$ $= p,$ if $n = 1$ Where $p,q$ are constants. The order of this algorithm is $n^{2}$ $n^{n}$ $n^{3}$ $n$ Algorithms nielit2017oct-assistanta-it algorithms recurrence-relation time-complexity master-theorem + – admin asked Apr 1, 2020 reopened Jun 25, 2022 by Lakshman Bhaiya admin 860 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Sanandan commented Sep 11, 2020 reply Follow Share Using masters theorem o(n^3) 0 votes 0 votes Lakshman Bhaiya commented Jun 25, 2022 reply Follow Share https://gateoverflow.in/336928/Nielit-2017-oct-scientific-assistant-a-cs-section-c-4 0 votes 0 votes Please log in or register to add a comment.