Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged divide-and-conquer
4
votes
3
answers
61
Algorithm
How many term will be computed to determine the value of $10C8$ Using a divide and conquer algorithms ? 45 46 90 89
How many term will be computed to determine the value of $10C8$ Using a divide and conquer algorithms ?45469089
ManojK
1.7k
views
ManojK
asked
May 20, 2016
Algorithms
algorithms
divide-and-conquer
+
–
0
votes
2
answers
62
finding pair of an element in the array such that diff will be given no.
venky.victory35
727
views
venky.victory35
asked
Dec 19, 2015
Algorithms
algorithms
time-complexity
dynamic-programming
divide-and-conquer
test-series
+
–
0
votes
1
answer
63
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)
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 conq...
ajit
663
views
ajit
asked
Sep 7, 2015
Algorithms
divide-and-conquer
sorting
time-complexity
+
–
0
votes
2
answers
64
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
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 con...
ajit
823
views
ajit
asked
Sep 7, 2015
Algorithms
algorithms
divide-and-conquer
recurrence-relation
+
–
0
votes
1
answer
65
How can we found second smallest element with n+[lgn]-2 comparisons in worst case ??
Abhishek Kumar
3.5k
views
Abhishek Kumar
asked
Jan 10, 2015
Algorithms
divide-and-conquer
sorting
algorithms
+
–
Page:
« prev
1
2
3
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
