GATE Overflow - Recent questions tagged divide-and-conquer
https://gateoverflow.in/tag/divide-and-conquer
Powered by Question2AnswerTime complexity of divide and conquer
https://gateoverflow.in/171548/time-complexity-of-divide-and-conquer
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=15582368689675775794"></p>Algorithmshttps://gateoverflow.in/171548/time-complexity-of-divide-and-conquerSat, 18 Nov 2017 09:37:03 +0000CLRS Divide-and-Conquer Strassens's algorithm
https://gateoverflow.in/158752/clrs-divide-and-conquer-strassenss-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?Algorithmshttps://gateoverflow.in/158752/clrs-divide-and-conquer-strassenss-algorithmMon, 09 Oct 2017 16:56:10 +0000Ace practice book
https://gateoverflow.in/130113/ace-practice-book
how to apply master's method for this recurrence relation <br />
<br />
$T\left ( n \right )= {}\sqrt{n}T\left ( {\sqrt{n}} \right )+n$Algorithmshttps://gateoverflow.in/130113/ace-practice-bookFri, 19 May 2017 01:10:23 +0000difference between dynamic programming and divide and conquer technique is
https://gateoverflow.in/125936/difference-between-dynamic-programming-conquer-technique
What is the difference between dynamic programming and divide and conquer technique,Algorithmshttps://gateoverflow.in/125936/difference-between-dynamic-programming-conquer-techniqueMon, 17 Apr 2017 13:16:14 +0000min max using divide and conquer
https://gateoverflow.in/122408/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??<br />
<br />
RECURRENCE RELATION IS<br />
<br />
$ T(n) = 2 T(\frac{n}{2}) + 2 $<br />
<br />
IT SHOULD COME TO $ \frac{3*n}{2} - 2 $<br />
<br />
??Algorithmshttps://gateoverflow.in/122408/min-max-using-divide-and-conquerThu, 23 Mar 2017 23:22:38 +0000Divide and conquer
https://gateoverflow.in/116863/divide-and-conquer
<p><img alt="" src="https://gateoverflow.in/?qa=blob&qa_blobid=7943001960008370790"></p>
<p><strong>Reply with solution @Arjun sir,@habibkhan,@vijaycs</strong></p>Algorithmshttps://gateoverflow.in/116863/divide-and-conquerTue, 07 Feb 2017 13:15:15 +0000divide and conquer
https://gateoverflow.in/85769/divide-and-conquer
Consider an array containing ānā elements. The elements present in an array are in arithmetic progression, but one element is missing in that order. What is the time complexity to find the position of the missing element using divide and conquer?Algorithmshttps://gateoverflow.in/85769/divide-and-conquerFri, 25 Nov 2016 08:49:03 +0000Divide and conquer+Dynamic
https://gateoverflow.in/72538/divide-and-conquer-dynamic
<p><img alt="Loading Question" src="https://d2190hpfa85jkd.cloudfront.net/q/b447cbf84ec3a8edd819eeb39fc6523f.jpg"></p>Algorithmshttps://gateoverflow.in/72538/divide-and-conquer-dynamicSat, 08 Oct 2016 17:09:29 +0000CMI2013-B-04
https://gateoverflow.in/46614/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)$.Algorithmshttps://gateoverflow.in/46614/cmi2013-b-04Mon, 23 May 2016 14:37:38 +0000CMI2012-B-04
https://gateoverflow.in/46567/cmi2012-b-04
<p>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 <span style="white-space: pre-wrap; line-height: 1.6;">A[i] == A[j] </span><span style="line-height: 1.6;">and </span><span style="white-space: pre-wrap; line-height: 1.6;">A[i] != A[j]</span><span style="white-space: pre-wrap; line-height: 1.6;">, but comparisons such as $A[i] < A[j]$ are not meaningful. (Imagine that the objects are JPEG images.) The array A is said to have a majority element if strictly more than half of its 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.</span></p>
<p> </p>
Algorithmshttps://gateoverflow.in/46567/cmi2012-b-04Mon, 23 May 2016 09:10:44 +0000Algorithm
https://gateoverflow.in/46265/algorithm
<p>How many term will be computed to determine the value of $10C8$ Using a divide and conquer algorithms ?</p>
<ol>
<li>45</li>
<li>46</li>
<li>90</li>
<li>89</li>
</ol>Algorithmshttps://gateoverflow.in/46265/algorithmFri, 20 May 2016 06:34:01 +0000