0
greedy method does not give best solution always.but divide and conquer gives the best optimal solution only(for example:quick sort is the best sort).greedy method gives feasible solutions,they need not be optimal at all.divide and conquer and dynamic programming are techniques.
What else can I help you with?
What is difference between a product and a quotient?
product is to multiply and quotient is to divide.!
How do you simplify a fraction with the Euclidean algorithm?
1) You use the Euclidian algorithm to find the greatest common factor between the numerator and the denominator. 2) You divide numerator and denominator by this greatest common factor. This will give you an equivalent fraction in simplest terms.
Find the slope between the following points. (0 4) and (5 -7)?
Simply divide the difference in the y-coordinates, by the difference in the x-coordinates.
Divide And Conquer?
Cubicle dividers keep everyone on task. Cubicle dividers can make workers feel as though they have their own office, even if they don't.
What is the slope of the line passing through (6 -3) and (8 0).?
Points: (6, -3) and (8, 0) Slope: 3/2
Divide and conquer what does it mean?
Divide and conquer is computer science. It is an important algorithm design.
What is the efficiency of the median finding algorithm using divide and conquer in comparison to other algorithms for finding the median?
The efficiency of the median finding algorithm using divide and conquer is generally better than other algorithms for finding the median. This is because the divide and conquer approach helps reduce the number of comparisons needed to find the median, making it more efficient in most cases.
Is quick sort is an example of dynamic programming algorithm?
quick sort is a divide and conquer method , it is not dynamic programming
What is the algorithm for finding the closest pair of points using the divide and conquer approach?
The algorithm for finding the closest pair of points using the divide and conquer approach involves dividing the points into two halves, finding the closest pair in each half, and then checking for a closer pair that crosses the dividing line. This process is repeated recursively until the closest pair is found.
How does the merge sort algorithm exemplify the divide and conquer strategy in sorting algorithms?
The merge sort algorithm demonstrates the divide and conquer strategy by breaking down the sorting process into smaller, more manageable parts. It divides the unsorted list into smaller sublists, sorts each sublist individually, and then merges them back together in a sorted manner. This approach helps in efficiently sorting large lists by tackling the problem in smaller, more manageable chunks.
What is an efficient algorithm to merge k sorted lists in O(n log k) time complexity?
One efficient algorithm to merge k sorted lists in O(n log k) time complexity is the "Merge with Divide and Conquer" approach. This algorithm involves recursively dividing the k lists into two halves, merging them individually, and then merging the resulting halves until all lists are merged. This approach ensures a time complexity of O(n log k) by utilizing the divide and conquer strategy to efficiently merge the sorted lists.
What were the salami tactics?
Divide and conquer also known as divide and rule were the tactics that Salami used. The Salami tactics were divide and rule or rather divide conquer.
What is the difference between divide and watershed?
i have on clue
What does the saying divide and conquer mean?
Organize your sources and conquer your obstacles.
What are the ratings and certificates for Divide and Conquer - 1943?
Divide and Conquer - 1943 is rated/received certificates of: Australia:PG Sweden:15
How do you write divide and conquer in latin?
Divide et impera
Why was psychology developed?
Divide an Conquer.
