GATE CSE
First time here? Checkout the FAQ!
x
+2 votes
166 views

Please show the working

asked in Algorithms by Junior (975 points) 7 39 67 | 166 views
Where's d image??

2 Answers

0 votes
answered by Active (1.6k points) 2 8 19
0 votes
Correct answer is O(n log (base 4/5) n) so according to ans it would be O(n logn)

Here T(n) = O(n) + T(n/5) + T(4n/5)

T(n) = Cn+T(n/5)+T(4n/5) here

we will make recurrence tree between which will be between n/5 and 4n/5

and you will get n/(4n/5)^k = 1

 k = log (base 4/5) n

so Cn* (log (base 4/5) n) = o(nlogn)
answered by anonymous 1 1 2
nlog(base 5/4)n. Right?   Not nlog(base 4/5)n
NO it will be 4/5 only
5/4 is correct check the similar question in the above link.

Related questions

+3 votes
2 answers
1
asked in Algorithms by worst_engineer Boss (5.6k points) 24 73 114 | 528 views
+2 votes
2 answers
2
asked in Algorithms by Kapil Veteran (50.4k points) 22 90 410 | 606 views
+2 votes
3 answers
3


Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Top Users Oct 2017
  1. Arjun

    23242 Points

  2. Bikram

    17048 Points

  3. Habibkhan

    7096 Points

  4. srestha

    6012 Points

  5. Debashish Deka

    5430 Points

  6. jothee

    4928 Points

  7. Sachin Mittal 1

    4762 Points

  8. joshi_nitish

    4278 Points

  9. sushmita

    3954 Points

  10. Rishi yadav

    3744 Points


Recent Badges

Popular Question Ml_Nlp
Notable Question set2018
Notable Question rahul sharma 5
Notable Question Sanjay Sharma
Notable Question Lakshman Patel RJIT
Popular Question makhdoom ghaya
Popular Question Çșȇ ʛấẗẻ
Reader kenzou
Popular Question mystylecse
Notable Question Sanjay Sharma
27,262 questions
35,076 answers
83,760 comments
33,185 users