Unnamed: 0 int64 1 5.86k | Question stringclasses 24
values | Sample ANS stringclasses 24
values | Student ANS stringlengths 1 1.06k | Score float64 0 2.5 |
|---|---|---|---|---|
1,727 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | merge sort, quick sort, median search, binary search | 2.5 |
1,728 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Examples are:\nBinary Search\nMerge Sort\n\n | 2 |
1,729 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Merge sort, Quick sort | 2 |
1,730 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | insertion sort , quick sort are the very common examples of divide and conquer algorithms. | 2 |
1,731 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Some Examples of divide and conquer algorithms are- Binary search,merge sort,bubble sort,selection sort,insertion sort and median search | 2.5 |
1,732 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Divide and conquer algorithms are used in solving many problems (like to find minimum distance between two points in a plane, etc ) . The concept of this algorithm is to divide the main problem into smaller subproblems. Then we find solution of these smaller subproblems and subsequently compute the solution of main, bi... | 2.5 |
1,733 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | merge sort ,quick sort etc. are the example of divide and conquer as in divide nd conquer we divide the problem into subproblem and then recursively get the resultant output by combining the output got from subproblems. | 2.5 |
1,734 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Merge Sort: In which we keep dividing the arrays into sub arrays until only one element is present in each sub array. Then we merge those sub-arrays into a sorted array.\nQuick Sort: The pivot divides the array in 2 parts one side sorted and one side unsorted. the pivot keeps on changing as the array gets sorted.\nBina... | 2.5 |
1,735 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Binary search, quick sort and merge sort. | 2.5 |
1,736 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Binary search, quicksort and merge sort. | 2.5 |
1,737 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Some example of divide and conquer algorithm are :\n1) merge sort\n2)quick sort\n3)binary search\n\n\n | 2.5 |
1,738 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Some examples of divide and conquer algorithms are:\n1. Merge sort\n2. Closest points | 2.5 |
1,739 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | some common examples for divide and conquer algorithm are merge sort, quick sort, binary search, radix sort. | 2.5 |
1,740 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | graph coloring\n\nHamiltonian cycle\n | 1 |
1,741 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | some common examples of divide and conquer algorithms are merge sort, quick sort ,etc. | 2.5 |
1,742 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | some examples of divide and conquer are-1->merge sort 2->radix sort 3->binary search 4->quick sort. | 2.5 |
1,743 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Some Examples of divide and conquer algorithms are: \nMerge sort, Quick sort, binary search, etc. | 2.5 |
1,744 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Some examples of divide and conquer are Binary search, Merge Sort and Quick sort. | 2.5 |
1,745 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Examples are:\nquick sort , binary search , merge sort | 2.5 |
1,746 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Some examples of divide and conquer algorithms are : Merge and Quick Sort. | 2.5 |
1,747 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Some examples of divide and conquer are:\n1. Merge Sort.\n2. Quick Sort.\n3. Binary Search. | 2.5 |
1,748 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | divide and conquer algorithms include binary search, finding subsets, merge sort, quick sort, etc. | 2.5 |
1,749 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Binary search\nMerge Sort | 2.5 |
1,750 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | some examples of divide and conquer Algorithms include median search, quicksort, merge sort ,binary search etc. Here they divide the problem into further smaller sub problems and recurs to find perform the desired operation. | 2.5 |
1,751 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | in divide and conquer algorithm you divide the problem into multiple small problems and then accordingly try to find the desirable solution in all the small problems. \nImagine you have to search for a particular value in a given array of input by the user, it will be very time consuming if you do it by brute force app... | 2.5 |
1,752 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Divide and Conquer algorithms are to divide the bigger problem into smaller subproblems, then solving the subproblems and eventually obtaining the result of the original problem.\nThe best example of this algorithm is - Merge Sort.\nIn Merge Sort, the array is divided into subarrays till one element is left in each. Th... | 2.5 |
1,753 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Various searching and sorting techniques use the divide and conquer approach like normal search , binary sorting, insertion sort, selection sort etc | 2.5 |
1,754 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Examples of divide and conquer are:\nBinary search algorithm, quick-sort, merge sort, N-queens problem, etc. | 2.5 |
1,755 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | example of Divide And Conquer algorithm are:\nQuicksort\nMerge Sort\nBinary Search\nN-Queens,\nRat in a MAze | 2.5 |
1,756 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Examples of divide and conquer algorithms are:\nN-knights\nRat in a maze\nN-Queens | 1 |
1,757 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Binary search, merge sort, etc. | 2.5 |
1,758 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Examples of Divide and conquer algorithm are- merge sort, binary search. | 2.5 |
1,759 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Various sorting and searching techniques are based on divide and conquer algorithm like merge sort, binary search. Binary tree traversal also comes under divide and conquer algorithm. | 2.5 |
1,760 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Examples:\n1. Merge Sort\n2. Quick Sort\n3. Binary Search | 2.5 |
1,761 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Merge Sort, Quick Sort | 2 |
1,762 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | merge sort, quick sort, etc. | 2 |
1,763 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | It can be used in merge sort , quick sort and other algorithms that require breaking the problem into smaller pieces, solving them and then recombine | 0 |
1,764 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Merge sort, quick sort | 2 |
1,765 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | merge sort\nquick sort\nradix sort and many more | 2.5 |
1,766 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Examples to divide and conquer algorithms - merge sort, quick sort, binary search | 2.5 |
1,767 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Merge sort, \nQuick sort\nBinary search\n | 2.5 |
1,768 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | 1)Fibonacci series\n | 1 |
1,769 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | merge sort , quick sort | 2.5 |
1,770 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Quick Sort\nBinary Search\nMerge sort | 2.5 |
1,771 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Binary search | 1.5 |
1,772 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | examples of divide and conquer algorithms:\n1. merge sort\n2. binary search | 2.5 |
1,773 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Some examples are merge sort, quick sort, binary search. | 2.5 |
1,774 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | There are multiple examples of divide and conquer few of which are \n1. merge sort ( splits the given data further and further while swapping)\n2. binary search | 2.5 |
1,775 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Divide and conquer algorithm examples are merge sort, quick sort and closest-pair algorithm | 2.5 |
1,776 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | EXAMPLES OF THE CONQUER ALGOROTHMS ARE :_\nMERGE SORT\nQUICK SORT\nSELECTION SORT\nINSERTION SORT\n | 2.5 |
1,777 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | quick sort ,merge sort ,binary search | 2.5 |
1,778 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Some examples of divide and conquer algorithms are: \n1. Merge Sort\n2. Binary Search | 2.5 |
1,779 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Quick sort, Binary search, Merge sort are some examples of divide and conquer algorithms. | 2.5 |
1,780 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | merge sort, quick sort. | 2.5 |
1,781 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | 1.Binary Search\n2. Merge sort\n3. Quick sort | 2.5 |
1,782 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | divide and conquer algorithm works on the basis that we divide the problem into set of small problems and then solve them at an individual level and later compile them together to define the final solution of the problem.\neg-Merge sort, insertion sort, selection sort. | 2.5 |
1,783 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | quick sort\nmerge sort | 2.5 |
1,784 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Following are some examples of divide and conquer algorithms:\n->Merge sort\n->Quick sort\n->Binary search | 2.5 |
1,785 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Merge sort, quick sort are some of the examples of divide and conquer algorithms. | 2.5 |
1,786 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | some divide and conquer algorithms are\nquicksort\nbucket sort\nradix sort\nbinary search\n | 2.5 |
1,787 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Merge Sort and quick sort is the the example of divide and conquer. | 2.5 |
1,788 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | binary search\nmerge sort | 2.5 |
1,789 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | divide - merge sort , | 2.5 |
1,790 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Merge Sort, \nQuick Sort,\nBinary Search | 2.5 |
1,791 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | merge sort,binary search | 2.5 |
1,792 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | some examples of divide and conquer algorithms are:\nMerge Sort\nQuick Sort\nBinary Search | 2.5 |
1,793 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | binary search , merge sort, quick sort | 2.5 |
1,794 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | quick sort and merge sort | 2.5 |
1,795 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | binary search\nmerge sort | 2.5 |
1,796 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Merge Sort\nQuick Sort\n | 2.5 |
1,797 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | merge sort , quick sort are some examples of divide and conquer algorithms. | 2.5 |
1,798 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Merge sort, quick sort, Closest pair of points. | 2 |
1,799 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | merge sort, quick sort and binary search | 2 |
1,800 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Merge Sort\nQuick Sort | 2 |
1,801 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Merge sort , binary search | 2 |
1,802 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | merge sort, insertion sort | 2 |
1,803 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Merge sort , quick sort, closest pair problem, are the examples of divide and conquer algorithm | 2.5 |
1,804 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Merge sort, quick sort are some examples of divide and conquer.\nFinding closest pairs in a plane is a problem in which we can apply the divide and conquer approach. | 2.5 |
1,805 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | sorting techniques like quick sort and binary sort can also be an eg | 2.5 |
1,806 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Some examples of divide and conquer are:\n1- Binary Search\n2- Merge sort\n3- Quicksort | 2.5 |
1,807 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Quick sort , merge sort | 2.5 |
1,808 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Solving the n queen problem, merge-sort | 2 |
1,809 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | used in MERGE SORT here the array is divided into two halves and smaller of the two values \ngets matched at the end.\nused in BINARY SEARCH here we first sort the array and find the mid element and place the right element in its \nright position and reducing our complexity which reduces to O(LOG N)\n | 1 |
1,810 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | One good Example of divide and conquer is binary Search in which we divide our search space accordingly and doing operation on that required search space.\nOther examples are:\n->Quick Sort\n->Ternary Search (somewhat extension of binary search | 1 |
1,811 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | merge sort\nquick sort | 2 |
1,812 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Examples of divide and conquer algorithm are binary search , dynamic programming. It is used when same subproblems are not evaluated many times. | 2 |
1,813 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | merge sort\nquick sort\nradix sort | 1 |
1,814 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Binary Search\nQuicksort\nMerge Sort\n | 2 |
1,815 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Quick Sort\nMerge Sort - The Array is subdivided to smaller arrays and after reaching the unit array they are combined.\nBubble Sort- An array element constantly being compared with previous array element then swapping takes place.\n | 1 |
1,816 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Some examples of divide and conquer are Merge sort and quick sort | 1 |
1,817 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | merge sort, N-queen, rat in a maze | 1 |
1,818 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Merge sort, binary search | 2 |
1,819 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Merge Sort, Quick Sort, Radix Sort, | 1 |
1,820 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | merge sort\nbinary search | 1 |
1,821 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Divide and Conquer utilizes solving of a problem by breaking down the data set into smaller subsets and then performing the desired operations on it. And then subsequently, perform it again and again while bringing it all together to achieve the final solution.\nFollowing are some examples\n1) Quick Sort\n2) Merge Sort | 2 |
1,822 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | whose complexity is better than the brute force approach. | 1 |
1,823 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | 1. Merge sort\n2. Binary search \n3. Quick sort | 2 |
1,824 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | divide and conquer is used in binary seach for eg. to search a page in dictionary\nalso in merge sort eg. to sort an array of elements. | 2 |
1,825 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | Merge sort , quick sort, Closest Pair of Points\nStrassen’s Algorithm of matrix multiplication | 2 |
1,826 | What are some examples of divide and conquer algorithms? | The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points) | There are various approaches to develop an algorithm such as divide and conquer ,backtracking .\nThe algorithms which is developed using the divide & conquer techniques involve three steps: Divide the original problem into various subproblems. Solve every subproblem individually, recursively. Combine the solution of th... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.