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 |
|---|---|---|---|---|
2,984 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | It selects one element and puts it in it's rightful position and then do it for the elements on it's right and on it's left recursively. | 1 |
2,985 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | quick sort uses a pivot point for the sorting purpose and categorize the equal to, less than, and greater than where the pivot point is again selected and the procedure goes again till the list gets sorted | 2 |
2,986 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick sort takes a element as a partition and divides the array and then with the help of swapping, it arranges all the numbers which are smaller than the partition element to the left of the array and the elements which are larger than the partitioned element are arranged to the right of the array. The process repeats... | 2.5 |
2,987 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | In quick sort, \n1)choose a pivot element randomly from a list.\n2) All the elements lesser than the pivot are put to the left side of the pivot, and all the elements greater than the pivot are put to the right side of pivot\n3) The process is repeated for the left and the right side | 2.5 |
2,988 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick sort uses a key value and then compare with other elements present in the array. | 1 |
2,989 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | picks an element as pivot and partitions using it and then sorts , it is based on divide and conquer | 2 |
2,990 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | It works on the model of Divide and conquer algo in which it is divided in two parts then sorted and recursive steps are call to receive a sorted data | 2 |
2,991 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | its sorting algorithm its take O(n) time in sorting \nIts divide the number of element in 2 part and take the key and find whether the mid element is greater, equal and lesser than or not .if not again its divide its. | 2 |
2,992 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | in quick sort we take a random element which works as a pivot and then partition the elements according to the pivot and placing the pivot in its correct position | 2 |
2,993 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | We need a pivot point , then we consider all the elements smaller than pivot to the left of it and sort them , then we consider all the elements larger than the pivot at the right of pivot and sort them . At the end we have a sorted array. | 2.5 |
2,994 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | quick sort takes a middle element and sorts according to whether the coming element is greater or less than the given element | 2 |
2,995 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | In quick sort we choose a pivot it can be last or first element of an array than we break it into two parts such that we have pivot+1 elements in one array and remaining in another array then we sort the array by keep on comparing it with pivot and meanwhile increasing the index of pivot. | 2 |
2,996 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | In the quick sort we define the pivot point where pivot point can be define as a first element of the array ,last element of the array and the middle part of the array .By the help of pivot point we can traverse the the i and j pointer so that sort the given array .and after the print the array. And the complexity is d... | 2 |
2,997 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | it a divide and conquer based searching technique | 1 |
2,998 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | In quick sort, we first define a pivot element, for which we can take the first, last or the middle element of the array. We then sort the array according to the pivot element such that it reaches its sorted position. We then repeat the process on both sides of the pivot element using recursive call until all the eleme... | 2 |
2,999 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | In quick sort, a pivot point is selected and all the other elements are compared to that element. The elements smaller than that element are placed on the left side of that element and the elements larger than the element are placed on the right side. The same procedure is repeated on the left side elements and the rig... | 2.5 |
3,000 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | quicks sort works on the principle of divide and conquer | 1 |
3,001 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick sort works by taking a random element 'a' from the array and assigning the rest of the elements to three arrays s1 , s2 and s3. \ns1 contains the elements that are less than a\ns2 contains element 'a'\ns3 contains elements greater than 'a'\nif |s1|>a\ncall the function with (a,|s1|-a,s2,s3)\nelse if |s1|+|s2| > ... | 1 |
3,002 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick sort is one of the most efficient sorting algorithms. It works by breaking an array (partition) into smaller ones and swapping (exchanging) the smaller ones, depending on a comparison with the 'pivot' element picked. | 2 |
3,003 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | It divides the array into parts till it got divided into individual units and then compares the 2 units at a time and then combined them in sorted fashion till the array gets sorted. | 2 |
3,004 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick sort is to find a pivot elemnt then comparing the elements if greater put right side else left side. | 2 |
3,005 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick sort takes a pivot element and based on the value of the pivot all smaller elements goes left while all larger goes right of the pivot. The array is broken down into sub arrays like in merge sort and then we sort the basic sub arrays just to merge them and form the sorted array once again. | 2.5 |
3,006 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | \nin quick sort the array is divided in half with each pass till we reach upto the minimal level that is element level and then compare it with the array next to it to sort it in the correct order | 2 |
3,007 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quicksort is a type of divide and conquer algorithm for sorting an array, based on a partitioning it\nTo sort an array using quick sort we do following steps:\n1. You will make any index value in the array as a pivot.\n2. Then you will partition the array according to the pivot.\n3. Then you will recursively quicksort ... | 2 |
3,009 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | quick sort algorithm is the process of arranging the element in the some order as accending order or decending order this algo take the privote element and sort the element in better timr complexcity and give as trhe result in faster way. | 1 |
3,010 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | We make a pivot element,\nWe start a loop, i starting from position 0 and j starting from position n - 1, comparing the elements, if the element is smaller than the pivot element, send it to the left side of the pivot element and if it is greater than the pivot element, send it to the right of the pivot element | 2.5 |
3,011 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | we take a pivot point and then count the number of elements smaller than the pivot.Move the pivot to its original place.move the elements smaller from pivot to the left (order/sorting)doesnt matter and bigger than pivot to right pass both the array to quic sort again.this eventually selects pivots and keeps them in rig... | 2.5 |
3,012 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick Sort works by breaking an array into smaller ones and swapping the smaller ones depending on the comparison based on the pivot element picked. | 2 |
3,013 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | in quick sort we take a pivot element and compare the numbers from the pivot element such that small numbers are present on the left side and greater numbers are present on the right side | 2 |
3,014 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick sort works by taking a pivot either as start element,mid element,or last element,Then initialising i and j index Doing i++till we get an element at i that is greater than pivot and j++ till we get an element less than pivot, comapring with pivot and swapping pivot and A[j].It is a divide and conquer algorithm. | 2.5 |
3,015 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | quick sort works by taking a pivot element than comparing it with an element in the array and changing swapping elements if the element greter than or lesser than it is found depending upon pivot element that is chosen. | 2 |
3,016 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick sort firstly select a pivot point and then place that selected pivot point at its correct location. | 1 |
3,018 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick sort works by breaking an array into smaller ones and swapping the smaller ones depending on the element picked. | 1 |
3,019 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | quick sort works by assigning random (preferably first or last) element to pivot, and then using quicksort algorithm we rearrange elements less than pivot to the left of pivot and elements greater than pivot to the right of pivot. This algorithm works recursively until array is sorted. | 2.5 |
3,020 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick sort works on the Divide and Conquer principle.\nIt is partition's the array using Lomuto partition and then joins it in a sorted manner.\nIt is a tail recursive function. | 2 |
3,021 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick sort are the sorting algorithm in which we compare our element to the just next element of our array . If the next element of our array is less than the previous one then we performs swap function between those two element else we do noting. | 1 |
3,022 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | first we chose a pivot and divide the araray in more 2 parts and we continue to do it and at the end we combine them while sorting happens. | 1 |
3,023 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | quick sort works first we have to find partition element it is generally the last element of the array then we find partition array in which we fix the correct position of the partition element and then with divide and conquer algorithm we make recursive call to find position for elements before partition element and a... | 2 |
3,024 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick sort is a divide and conquer algorithm. It has an average time complexity of nlogn but in worst case the time complexity is O(n^2)\n1. In quick sort an element is made a pivot element.\n2. The array is partitioned on the basis of the pivot element.\n3. Quick sort is recursively called on the partitioned arrays to... | 2.5 |
3,025 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | in quick sort we choose a pivot element and the ones which are less are arranged on the left side and greater ones on the right side and then again sorting is done in three sided after that the entire output is merged | 2.5 |
3,026 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick sort works according to divide and conquer approach, in this sorting method we make the use of \ | 1 |
3,027 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | In insertion sort we place element one by one on its correct position . In selection sort we first find the minimum and maximum element and then compare other element with these minimum and maximum element and swap the element | 1 |
3,028 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick sort is done by taking a random element (for example the middle element and taking the element as the pivot and then sorting the array in the sense that all elements lesser than the pivot are sorted to the left side of the pivot and all elements grater than the pivot are in the right side of the pivot (Although n... | 2.5 |
3,029 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | we try to place every element in its correct position in the array\nwe make two pointers and start traversing from first and then check if the last pointer value is lesser or greater\nif greater than move the pointer and else swap it and move the pointer forward and similarly repeat this\nyou will every element in its ... | 1 |
3,030 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Divide AND Conquer Algorithm\nwhich divides our let say array in two different halves one by one then recursively sort and combine the array\n | 1 |
3,031 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | takes the first index and checks it whether it has any values smaller than that and post increment counter variable if it found the number . \nwe swap the first index with the index of counter value . \nthen we recursively checks both the sides of the first index value which is now positioned let say at x.\nthat's the ... | 2 |
3,032 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick sort is the sorting algorithm based on the divide and conquer algorithm that picks an element as a pivot and partitions the given array around the pivoted point by placing the pivot in correct position in sorted array. | 1 |
3,033 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | position indexing | 2 |
3,034 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | It works by breaking an array (partition) into smaller ones and swapping the smaller ones, depend upon the comparison with the pivot element that we have .\n | 2 |
3,035 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | A pivot is taken in this sorting. That pivot element undergoes for further comparison with key. if its less than key then key is searched in array before the pivot. | 1 |
3,036 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick sort uses a partition to divide the array into two parts and then sort the two parts individually(placing all elements at their right positions). It uses divide and conquer approach.\nIt works on the complexity of O(logn). | 2 |
3,038 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | In quick sort, a pivot is selected (first, last or random) using partition algo and a recursive call is made until the elements before pivot are smaller and elements after pivot are greater and the array is sorted. | 1 |
3,039 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | In quick sort, we define a pivot. then we bring all the values less than the pivot to it's left and all the values greater than the pivot to its right. After that we sort the left part and the right part recursively and we have the sorted array. | 2 |
3,040 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | quick sort works on partition algorithm .we select a pivot element that can be either beginning or last or middle or random element such that the elements before it are smaller than it and elements after it are larger than it. then we recursively call for pivot elements until the array is sorted. | 2 |
3,041 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick sort uses a pivot value, to split down the array. The values are compared at both sides, and then rearranged accordingly. The pivot is also switched with time and the flow of order of swapping. | 2 |
3,042 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | In selection sort, we firstly calculate the largest/smallest element in the array and swap it with the first element. In second phase, we repeat the thing, but here we calculate the largest/smallest in the remaining array (excluding first index). We keep repeating the process until the array is sorted.\n\nIn Insertion ... | 2 |
3,043 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Pivot is selected from the array. Then the array is divided into three parts cotaining elements less than, equal to, greater than the pivot. | 1 |
3,044 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | In quick sort, we take an element as pivot and we check for each element by taking two pointers and swap if it satisfies the IF CONDITION then if I>J then we just swap the pivot with j. | 2 |
3,045 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | It works by selecting a pivot element and breaking the array into smaller parts | 2 |
3,046 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | The insertion sort sorts a set of values by inserting the values into a presorted file. The selection sort, on the other hand, determines the least number from the list and arranges it in some order. Sorting is a fundamental procedure that involves placing an array's elements in a certain order to improve searchability... | 2 |
3,047 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick sort works by\nStep 1 : finding a pivot point at a random index of the array\nStep 2: Arranging the array in such a way that the left side of the pivot is smaller than the pivot value and the right side is greater than or equal to the pivot value.\nStep 3: Make a recursive call of the fn quick_sort on the both l... | 1 |
3,048 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | To sort an array, you will follow the steps below:\n1) You will make any index value in the array as a pivot.\n2) Then you will partition the array according to the pivot.\n3) Then you will recursively quicksort the left partition\n4) After that, you will recursively quicksort the correct partition. | 2 |
3,049 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick sort works on the principle of divide and conquer technique. First we take a pivot element - it can be first element, middle or last. Then we fix that pivot element in it's correct position by using basic for loops. Then we divide the array in parts - from 0 index to pivot-1 and pivot+1. We will not take that piv... | 1 |
3,050 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | quick sort works on the divide and conquer approach. it gives the ight position of a pivot and the elements on the left of the pivot should be smaller than pivot and right elements should be greater and then it works the same way on both the sides. | 2 |
3,051 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | it works on divide and conquer. array is divided on pivot element then the each part is sorted separtly . | 1 |
3,052 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick Sort works on the basis of position indexing.\nThe position array is created which is then converted into sorted array using the indexes. | 2 |
3,053 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | ) | 0 |
3,055 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | It works by partitioning an array into smaller arrays and exchanging the smaller ones, depending on a comparison with the 'pivot' element picked up. | 1 |
3,056 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | in quick sort a pivot element is chosen at random and then the whole array is sorted with respect to that element after that array is divided from the pivot in two parts and those two parts are sorted with a new randomly selected pivot for each part and the process continues till size of divided array minimizes to one ... | 2 |
3,057 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | quick sort work on divide and conquer approach . First array is divide into two parts then further divided into two parts until it reach to one element then compare b/w to element then combine the array. | 1 |
3,058 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick sort is a divide and conquer sorting algo in which a pivot element is chosen which then divides the array in two parts. Left part contains elements smaller than pivot element and right part contains elements larger than the pivot. | 1 |
3,059 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | In Insertion Sort the priority element(Greatest of smallest in the remaining array) is selected and putted into its correct position by shifting the other elements in the array.\n\nIn selection sort, the priority element is swapped with the element in its correct position.\n\nTime Complexity - O(n^2) | 2 |
3,060 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | quick sort use use min heap concept for reducing the time complexity of the algorithm , it use min heap concept and reduce it to (nlogn) time . | 1 |
3,061 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | it uses increments and as the loop progresses it arranges the order of elements till that particular range. It uses comparison\nton sort out the order among elements and is great for larger data sets. | 2 |
3,062 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | quick sort works divide and conquer method. | 1 |
3,063 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | in quick sort it divide the array into some parts and then perform sorting and arrange in ascending order as the need of the problem | 2 |
3,064 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick sort work by taking a pivot element and then partitioning the array into three parts one which contains elements smaller than pivot, other one which contains elements equal to the pivot and the last one containing the elements greater than the pivot. Then after this the process repeats itself recursively on the 1... | 1 |
3,065 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | quick sort is a searching algorithm in which we choose a pivot value from the array and make the two array and then sort the element in both the with the help of pivot element. | 2 |
3,066 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | In quick sort the one element is taken as a pivot and its correct position is taken out and then recursively we find the pivot for all the remaining array | 1 |
3,067 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | In quick sort, first we partition the array and sort both the arrays left and right of the partition. Then we sort both these arrays using quicksort recursively until we have one element which is already sorted. | 1 |
3,068 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | quick sort works on the basis of partitioning using a pivot element where we can partition the array by taking either first element or middle element or last element of the array as pivot and the array keeps on getting divided by pivot elements till the time one element is left in each partition and then sorting of ele... | 2 |
3,069 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | in insertion sort the minimum element is first assigned its correct position and then the further next minimum element is taken into consideration by this method the entire array is sorted.\nin selection sort the user selects a particular element which is the assigned its correct position and then with respect to it ot... | 1 |
3,070 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | quick sort works by creating partitions | 1 |
3,071 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | In quick sort we select an element and traverse the array and arrange elements such that all the elements smaller than our selected element are on the left side and the larger ones on right side . then we again recursively call quick sort on the left group of smaller elements and right group of larger elements . | 1 |
3,072 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick sort works by selecting a pivot in the array and then sorting all the elements smaller than the pivot and thus placing the pivot at the right place. It uses recursion and keeps repeating this process till the complete array is sorted. \n | 2 |
3,073 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Most efficient algorithm. It Works by partitioning an array into smaller ones and swapping the smaller ones depending on comparison with the pivot element. | 1 |
3,074 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | In quick sort, we select any one element as pivot (either from start , middle or end ) and we sort the data structure as per the pivot like on the left side the elements smaller than pivot are present and right side the elements greater than pivot are present or vice versa. | 2 |
3,075 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | in this first we take an pivot element and place it at the correct index where it should be in the sorted array. we do this using recursion and divide and conqour approach. | 1 |
3,076 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | These are different in approaches used to solve them. Insertion sort work as if we insert each element again and hence sorting them. Selection sort, as the name suggest work as if we have selected an element and then sorting it by comparing with every other element. | 2 |
3,077 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | quick sort involves a pivot element and based on the pivot it divides the array into three parts one the elements to its left that are the ones smaller than itself, second the elements equal to itself and third the elements larger than itself onto its right and it goes on doing this recursively on the two parts the lef... | 2 |
3,078 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick sort works on the basis of partitioning. First we select a pivot element and then partition the elements according to the pivot element and then sorts the array in the required order. The pivot element can be first element, last element, or middle element. | 2 |
3,079 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | In Quicksort, we simply take one element whether it may be first or last or any element and declare it as pivot. Then we partition our array on the basis of pivot in such a way that the pivot element reach at its correct position in the array. We repeat the process until the array is sorted.\n | 2 |
3,080 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | quick sort works on the principle of divide and conquer. First we take a pivot around which we divide the array the first half has the smaller than elements and the second half has the larger one. In this way we keep on dividing the array and lastly combine them. | 2 |
3,081 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | quick sort works using the divide and conquer approach. quick sort uses a partition element which can be any elements from the array. and sort the array according to that partition the elements lesser than the partition element move to the left of it and the bigger ones move towards the right, the movement is done by s... | 2 |
3,082 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick sort works on divide and conquer method and the partition method for sorting an array. In the partion we use a pivot either from begin , end , or accoding to desired location. \nThe complexity of this algorithm depends upon the selection of the best pivot,\nThe average case time complexity of the quick sort is O(... | 2 |
3,083 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | in quick sort we take a pivot element form the array and divide the array in two parts according to pivot element and decide new pivot element for new arrays and repeat the process\nthen sort the array and merge them one by one; | 2 |
3,084 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick sort works in following manner.\nIt divides the array by selecting a pivot element for the elements in the array which are greater than pivot are inserted into a new list and for smaller than pivot into another list.\nthen these lists are sorted and merged to obtain the original array as sorted | 2 |
3,085 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | it first find a partition and then arrange the elements accordingly , it works recursively by repeating the same and giving the required result at the end. | 2 |
3,086 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick Sort works works on the divide and conquer rule. A given array is divided and then sorted part by part known as partitions, to form a sorted array. | 2 |
3,088 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick sort works on the divide and conquer method, where you create partition in the array on the basis of comparing and the merge it in the ascending order. | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.