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
3
votes
0
answers
31
GeeksForGeeks
Maximum Subarray Sum problem is to find the subarray with maximum sum. For example, given an array {12, -13, -5, 25, -20, 30, 10}, the maximum subarray sum is 45. The naive solution for this problem is to calculate sum of all subarrays starting with every element and return ... complexity using Divide and Conquer. A O(n) B O(nLogn) C O(Logn) D O(n2) Correct answer is B. O(nLogn) How?
Rishav Kumar Singh
asked
in
Algorithms
Jul 27, 2018
by
Rishav Kumar Singh
6.7k
views
divide-and-conquer
algorithms
0
votes
1
answer
32
ACE Algorithms volume 2 Divede and Conquer Q 11
Given two sorted double linked list L1 and L2 of n elements each, which of the following are true? (A) L1 and L2 can be merged into single sorted list in Θ(n) time. (B) L1 and L2 can be merged into single sorted list in Θ(1) time. ( ... merged into single sorted list in Θ(nlogn) time. (D) L1 and L2 can be merged into single sorted list in Θ(n2) time.
JAYKISHAN
asked
in
Algorithms
Jul 5, 2018
by
JAYKISHAN
816
views
algorithms
ace-booklet
divide-and-conquer
2
votes
0
answers
33
Algorithm
You have an array A with n JPEG images 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], but comparisons such as A[i] < A[j] ... of its elements are equal to each other. Use divide and conquer to come up with an O(n logn ) algorithm to determine if A has a majority element.
Kushagra Chatterjee
asked
in
Algorithms
May 2, 2018
by
Kushagra Chatterjee
899
views
algorithms
time-complexity
divide-and-conquer
0
votes
1
answer
34
IIT MS Question
find T(n) = T(n-1)*T(n-2), given T(1) = a and T(2) = b
bittu
asked
in
Algorithms
Apr 25, 2018
by
bittu
1.3k
views
recurrence-relation
divide-and-conquer
0
votes
0
answers
35
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
561
views
divide-and-conquer
algorithms
asymptotic-notation
1
vote
1
answer
36
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
613
views
algorithms
divide-and-conquer
test-series
1
vote
2
answers
37
Multiplication of two long intergers
atul_21
asked
in
Algorithms
Jan 2, 2018
by
atul_21
953
views
divide-and-conquer
recurrence-relation
ace-test-series
1
vote
1
answer
38
ACE test series
please help me to understand
VIKRAM KASANA
asked
in
Algorithms
Dec 21, 2017
by
VIKRAM KASANA
648
views
algorithms
time-complexity
divide-and-conquer
ace-test-series
2
votes
1
answer
39
Time complexity of divide and conquer
Parshu gate
asked
in
Algorithms
Nov 18, 2017
by
Parshu gate
1.6k
views
algorithms
divide-and-conquer
time-complexity
ace-test-series
1
vote
1
answer
40
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
1.1k
views
time-complexity
divide-and-conquer
2
votes
2
answers
41
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
853
views
algorithms
divide-and-conquer
dynamic-programming
1
vote
1
answer
42
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
641
views
divide-and-conquer
sorting
time-complexity
2
votes
1
answer
43
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
975
views
time-complexity
divide-and-conquer
1
vote
0
answers
44
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
359
views
divide-and-conquer
maximum-sub-array-problem
algorithms
cormen
2
votes
3
answers
45
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 18, 2017
by
Devasish Ghosh
825
views
master-theorem
algorithms
divide-and-conquer
1
vote
4
answers
46
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
6.2k
views
divide-and-conquer
algorithms
dynamic-programming
programming
0
votes
1
answer
47
coremen
what is difference between divide and conquer and dynamic programming?
shebya nautiyal
asked
in
Algorithms
Apr 5, 2017
by
shebya nautiyal
1.4k
views
divide-and-conquer
dynamic-programming
3
votes
1
answer
48
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.6k
views
divide-and-conquer
algorithms
0
votes
3
answers
49
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
422
views
tbb-mockgate-3
algorithms
divide-and-conquer
sorting
quick-sort
2
votes
1
answer
50
Divide and conquer
Reply with solution @Arjun sir,@habibkhan,@vijaycs
Shubham Sharma 2
asked
in
Algorithms
Feb 7, 2017
by
Shubham Sharma 2
1.1k
views
algorithms
divide-and-conquer
0
votes
1
answer
51
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
1.1k
views
algorithms
numerical-answers
normal
divide-and-conquer
1
vote
1
answer
52
No of multiplications
santhoshdevulapally
asked
in
Algorithms
Dec 15, 2016
by
santhoshdevulapally
811
views
divide-and-conquer
numerical-answers
test-series
1
vote
1
answer
53
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
978
views
algorithms
divide-and-conquer
time-complexity
0
votes
1
answer
54
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
378
views
divide-and-conquer
sorting
heap-sort
time-complexity
3
votes
5
answers
55
#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
3.0k
views
sorting
time-complexity
divide-and-conquer
0
votes
1
answer
56
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
394
views
algorithms
divide-and-conquer
time-complexity
descriptive
0
votes
1
answer
57
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
299
views
time-complexity
divide-and-conquer
0
votes
1
answer
58
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
1.6k
views
algorithms
divide-and-conquer
time-complexity
descriptive
7
votes
1
answer
59
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
916
views
cmi2013
algorithms
sorting
divide-and-conquer
descriptive
1
vote
1
answer
60
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
1.1k
views
cmi2012
algorithms
divide-and-conquer
Page:
« prev
1
2
3
next »
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 questions tagged divide-and-conquer
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:...