1 votes 1 votes Partition algorithm O(n) splits into 1/5 and 4/5 elements. What is the time complexity? Algorithms algorithms time-complexity recurrence-relation + – A_i_$_h asked Jul 22, 2017 • retagged Jun 22, 2022 by makhdoom ghaya A_i_$_h 135 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes n spits into (1/5) and (4/5). So ,T(n)=1/5(n)+4/5(n) +c ,here c=constant Deepak Kumar 12 answered Jul 22, 2017 Deepak Kumar 12 comment Share Follow See all 2 Comments See all 2 2 Comments reply A_i_$_h commented Jul 24, 2017 reply Follow Share the answer is T(n) <= O(n) + 2T( 4n/5 ) how ? 0 votes 0 votes Deepak Kumar 12 commented Jul 24, 2017 reply Follow Share I think this help you- http://www.geeksforgeeks.org/algorithms-searching-and-sorting-question-23-2/ 1 votes 1 votes Please log in or register to add a comment.
