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
Recent questions tagged divide-and-conquer
0
votes
0
answers
31
divide and conquer
in questions like how many multiplications of n are needed are being solved by dividing n into n/2 * n/2 and then end up with recurrence t(n) = t(n/2) + O(1) How to reach this type of analysis where we get to know that we have to divide n into halves?
iarnav
asked
in
Algorithms
Jan 12, 2018
by
iarnav
391
views
divide-and-conquer
algorithms
asymptotic-notations
1
vote
1
answer
32
Test series
Consider a set of 156 elements to find minimum and maximum elements in the given set, the minimum number of comparisons required is___? You have given an array of 512 elements,minimum number of comparisons required to find out second largest element among all will be___? 230 & 517 229 & 516 231 & 518 232 & 519
vinay9427
asked
in
Algorithms
Jan 5, 2018
by
vinay9427
443
views
algorithms
divide-and-conquer
test-series
1
vote
2
answers
33
Multiplication of two long intergers
atul_21
asked
in
Algorithms
Jan 2, 2018
by
atul_21
735
views
divide-and-conquer
recurrence-relation
ace-test-series
1
vote
1
answer
34
ACE test series
please help me to understand
VIKRAM KASANA
asked
in
Algorithms
Dec 21, 2017
by
VIKRAM KASANA
443
views
algorithms
time-complexity
divide-and-conquer
ace-test-series
2
votes
1
answer
35
Time complexity of divide and conquer
Parshu gate
asked
in
Algorithms
Nov 18, 2017
by
Parshu gate
1.1k
views
algorithms
divide-and-conquer
time-complexity
ace-test-series
1
vote
1
answer
36
Long integer multiplication
Given 2 long integers having n digits , it is required to multiply them.Assuming the numbers are represented in an array of size n . The time complexity to multiply them using traditional divide and conquer is
A_i_$_h
asked
in
Algorithms
Oct 10, 2017
by
A_i_$_h
663
views
time-complexity
divide-and-conquer
2
votes
2
answers
37
CLRS Divide-and-Conquer Strassens's algorithm
Do we need to study the Strassens's algorithm in detail like proof or working of that algorithm or we just need to know the time complexity of the algorithm because I can't find it's explanation anywhere?
Manasi Srivastava
asked
in
Algorithms
Oct 9, 2017
by
Manasi Srivastava
611
views
algorithms
divide-and-conquer
dynamic-programming
1
vote
1
answer
38
Divide and Conquer
Given an unsorted array. The array has this property that every element in array is at most k distance from its position in sorted array where k is a positive integer smaller than size of array. Which sorting algo can be easily modified for sorting this array and what is the obtainable time complexity ?
chetan raghav
asked
in
Algorithms
Sep 3, 2017
by
chetan raghav
458
views
divide-and-conquer
sorting
time-complexity
2
votes
1
answer
39
algorithm
time complexity of multiplying two long integers of n - digits each using divide and conquer method is a)O(n^2) b)O(n) c)O(n^3) d)O(n logn)
A_i_$_h
asked
in
Algorithms
Jul 24, 2017
by
A_i_$_h
703
views
time-complexity
divide-and-conquer
1
vote
0
answers
40
Introduction to Algorithm 3rd ed
I implemented maximum sub-array problem with Divide and Conquer approach in c++ and python. I got little bit of confusion in the implementation.Below are the implementations. I got different results when I change the for loop of both c++ and python code.in ... In first case I am getting right output i.e 43 but in 2nd I am getting 56 as the output! Please help!
Alabhya Pandey
asked
in
Algorithms
Jul 21, 2017
by
Alabhya Pandey
278
views
divide-and-conquer
maximum-sub-array-problem
algorithms
cormen
2
votes
3
answers
41
Ace practice book
how to apply master's method for this recurrence relation $T\left ( n \right )= {}\sqrt{n}T\left ( {\sqrt{n}} \right )+n$
Devasish Ghosh
asked
in
Algorithms
May 19, 2017
by
Devasish Ghosh
572
views
master-theorem
algorithms
divide-and-conquer
1
vote
4
answers
42
difference between dynamic programming and divide and conquer technique is
What is the difference between dynamic programming and divide and conquer technique,
LavTheRawkstar
asked
in
Algorithms
Apr 17, 2017
by
LavTheRawkstar
5.6k
views
divide-and-conquer
algorithms
dynamic-programming
programming
0
votes
1
answer
43
coremen
what is difference between divide and conquer and dynamic programming?
shebya nautiyal
asked
in
Algorithms
Apr 5, 2017
by
shebya nautiyal
1.1k
views
divide-and-conquer
dynamic-programming
3
votes
1
answer
44
min max using divide and conquer
CAN SOMEONE SOLVE THE NUMBER OF COMPARISIONS FOR COMPUTING MIN AND MAX IN AN ARRAY USING DIVIDE N CONQUER?? RECURRENCE RELATION IS $ T(n) = 2 T(\frac{n}{2}) + 2 $ IT SHOULD COME TO $ \frac{3*n}{2} - 2 $ ??
sushmita
asked
in
Algorithms
Mar 23, 2017
by
sushmita
2.0k
views
divide-and-conquer
algorithms
0
votes
1
answer
45
Test by Bikram | Mock GATE | Test 3 | Question: 23
Partitioning and Merging are the two main parts of $Quick Sort$. Which of the following is TRUE? Partitioning is the key step while Merging is trivial. Partitioning is trivial while Merging is the key step. Both Partitioning and Merging are trivial. Both Partitioning and Merging are key steps.
Bikram
asked
in
GATE
Feb 9, 2017
by
Bikram
168
views
tbb-mockgate-3
algorithms
divide-and-conquer
sorting
quick-sort
2
votes
1
answer
46
Divide and conquer
Reply with solution @Arjun sir,@habibkhan,@vijaycs
Shubham Sharma 2
asked
in
Algorithms
Feb 7, 2017
by
Shubham Sharma 2
783
views
algorithms
divide-and-conquer
0
votes
1
answer
47
min-max algo
The minimum number of comparisons required to find the minimum and maximum of 60 numbers is____
iita
asked
in
Algorithms
Jan 24, 2017
by
iita
875
views
algorithms
numerical-answers
normal
divide-and-conquer
1
vote
1
answer
48
No of multiplications
santhoshdevulapally
asked
in
Algorithms
Dec 15, 2016
by
santhoshdevulapally
666
views
divide-and-conquer
numerical-answers
test-series
1
vote
1
answer
49
COMPLEXITY
Suppose that the votes of n people for different candidates (where there can be more than two candidates) for a particular office are the elements of a sequence. A person wins the election if this person receives a majority of the votes. What is the time complexity to find a candidate who receives majority of the votes using divide and conquer approach?
Rohan Mundhey
asked
in
Algorithms
Nov 9, 2016
by
Rohan Mundhey
668
views
algorithms
divide-and-conquer
time-complexity
0
votes
1
answer
50
Divide and Conquer
Merging K sorted list each of size n/k into one sorted list of n-elements using Heap Sort will take how much time?
Shailendra Patel
asked
in
Algorithms
Nov 1, 2016
by
Shailendra Patel
186
views
divide-and-conquer
sorting
heap-sort
time-complexity
2
votes
5
answers
51
#Divide and conquer
Given 2 sorted arrays each of n-elements and distinct. How much time it will take to find middle element of union array? (a) O(1) (b) O(log n) (c) O(n) (d) None of these
ayushigupta
asked
in
Algorithms
Oct 11, 2016
by
ayushigupta
2.3k
views
sorting
time-complexity
divide-and-conquer
0
votes
1
answer
52
divide and conquer
How to find the time complexity if finding the median of 2 sorted arrays?
Hardik Vagadia
asked
in
Algorithms
Aug 22, 2016
by
Hardik Vagadia
225
views
algorithms
divide-and-conquer
time-complexity
descriptive
0
votes
1
answer
53
Divide and Conquer
The time to optimally find the x raised to the power n by divide and conquer is ____?
Hardik Vagadia
asked
in
Algorithms
Aug 22, 2016
by
Hardik Vagadia
155
views
time-complexity
divide-and-conquer
0
votes
1
answer
54
median of 5 elements
how to find median of 5 distinct values with only 6 comparisons?
debanjan sarkar
asked
in
Algorithms
Jun 4, 2016
by
debanjan sarkar
927
views
algorithms
divide-and-conquer
time-complexity
descriptive
7
votes
1
answer
55
CMI2013-B-04
You are given two sorted lists of integers of size $m$ and $n$. Describe a divide and conquer algorithm for computing the $k$-th smallest element in the union of the two lists in time $O(\log m + \log n)$.
go_editor
asked
in
Algorithms
May 23, 2016
by
go_editor
615
views
cmi2013
algorithms
sorting
divide-and-conquer
descriptive
1
vote
1
answer
56
CMI2012-B-04
You have an array $A$ with $n$ objects, some of which are identical. You can check if two objects are equal but you cannot compare them in any other way - i.e., you can check $A[i] == A[j]$ and $A[i] != A[j]$ ... elements are equal to each other. Use divide and conquer to come up with an $O(n \log n)$ algorithm to determine if $A$ has a majority element.
go_editor
asked
in
Algorithms
May 23, 2016
by
go_editor
606
views
cmi2012
algorithms
divide-and-conquer
4
votes
3
answers
57
Algorithm
How many term will be computed to determine the value of $10C8$ Using a divide and conquer algorithms ? 45 46 90 89
ManojK
asked
in
Algorithms
May 20, 2016
by
ManojK
1.3k
views
algorithms
divide-and-conquer
0
votes
2
answers
58
finding pair of an element in the array such that diff will be given no.
venky.victory35
asked
in
Algorithms
Dec 20, 2015
by
venky.victory35
272
views
algorithms
time-complexity
dynamic-programming
divide-and-conquer
test-series
0
votes
1
answer
59
if this problem is solved using divide and conquer method ,then the algorithm run in
given a sorted array of distinct integers A[1........n], you want to find out whether there is an index i for which A[i]=i.if this problem is solved using divide and conquer method ,then the algorithm run in a) O(n) a) O(nlogn) a) O(logn) a) O(n2)
ajit
asked
in
Algorithms
Sep 7, 2015
by
ajit
403
views
divide-and-conquer
sorting
time-complexity
0
votes
2
answers
60
what is the divide and conquer recurrence that would arise for the problem
suppose you are given n bit integers asuming for common sense n as power of 2 .it is required to multiply them using divide and conquer method .what is the divide and conquer recurrence that would arise for the problem a) T(n)=4T(n/2)+c b) a) T(n)=2T(n/2)+n c) a) T(n)=4T(n/2)+n2 d) a) T(n)=4T(n)+n
ajit
asked
in
Algorithms
Sep 7, 2015
by
ajit
477
views
algorithms
divide-and-conquer
recurrence-relation
Page:
« prev
1
2
3
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
ISRO RECRUITMENT FOR SCIENTIST B THROUGH GATE
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
RECRUITMENT IN OIL AND GAS CORPORATION LIMITED
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(647)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(855)
Recent questions tagged divide-and-conquer
Recent Blog Comments
@abir_banerjee Thanks Abir. I'm third year...
@nolan_keats Currently I am in third year...
@abir_banerjee thank you Abir.Supposing you...
@nolan_keats just a suggestion as I also...
@abir_banerjee Hope I can do this in span of one...