Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
In this question the answer given is option (A) how it will come ?? Explain??
Çșȇ ʛấẗẻ
asked
in
Algorithms
Aug 28, 2016
retagged
Jul 13, 2022
by
makhdoom ghaya
313
views
1
vote
1
vote
algorithms
asymptotic-notation
time-complexity
test-series
Çșȇ ʛấẗẻ
asked
in
Algorithms
Aug 28, 2016
retagged
Jul 13, 2022
by
makhdoom ghaya
by
Çșȇ ʛấẗẻ
313
views
answer
comment
Follow
share this
share
0 Comments
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
0
votes
0
votes
$f(n)$ + $g(n)$ = $max(f(n) + g(n))$
air1
answered
Aug 28, 2016
by
air1
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
← Previous
Next →
← Previous in category
Next in category →
Related questions
1
vote
1
vote
2
answers
1
Çșȇ ʛấẗẻ
asked
in
Algorithms
Aug 28, 2016
343
views
Explain how it has come in detali? #Algo
Çșȇ ʛấẗẻ
asked
in
Algorithms
Aug 28, 2016
by
Çșȇ ʛấẗẻ
343
views
algorithms
time-complexity
test-series
0
votes
0
votes
0
answers
2
usdid
asked
in
Algorithms
Apr 16, 2022
273
views
a) what is the iterative equation showing the running time of the algorithm whose pseudocode is given below? b) What is this repeated equation in asymptotic notation using the Master's theorem. c) What is the same repeated equation in asymptotic notation using the recursion tree method.
usdid
asked
in
Algorithms
Apr 16, 2022
by
usdid
273
views
asymptotic-notation
time-complexity
algorithms
0
votes
0
votes
1
answer
3
dhruba
asked
in
Algorithms
May 29, 2023
412
views
Consider a divide and conquer algorithm that divides an input of size n into a subproblems, each of size n/b, and the cost of dividing and merging the problems is given by f(n) = Θ(n^c). The Master Theorem classifies this into different cases based on the value of c in relation to log_b(a). Could you explain the intuition and reasoning behind these classifications?
dhruba
asked
in
Algorithms
May 29, 2023
by
dhruba
412
views
algorithms
time-complexity
divide-and-conquer
0
votes
0
votes
2
answers
4
venky.victory35
asked
in
Algorithms
Dec 19, 2015
736
views
finding pair of an element in the array such that diff will be given no.
venky.victory35
asked
in
Algorithms
Dec 19, 2015
by
venky.victory35
736
views
algorithms
time-complexity
dynamic-programming
divide-and-conquer
test-series
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
