Harsh-7300/dataset huggingface dataset:
Question: How quick sort works?
Reference answer: 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.

Student answer: picks an element as pivot and partitions using it and then sorts , it is based on divide and conquer
Score: 2.0

Student answer: 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
Score: 2.0

Student answer: 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. 
Score: 2.0

Student answer: 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
Score: 2.0

Student answer: 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.
Score: 2.5

Student answer: quick sort takes a middle element and sorts according to whether the coming element is greater or less than the given element 
Score: 2.0

Student answer: 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.
Score: 2.0

Student answer: 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 different for all the different pivot points.
Score: 2.0

Student answer: it a divide and conquer based searching technique
Score: 1.0

Student answer: 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 elements are sorted. 
Score: 2.0

Student answer: 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 right side elements.
Score: 2.5

Student answer: quicks sort works on the principle of divide and conquer
Score: 1.0
Question: How quick sort works?
Reference answer: 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.

Student answer: 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| > a (a,|s1|+|s2|-a,s2,s3)\n
Score: 1.0

Student answer: 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.
Score: 2.0

Student answer: 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.
Score: 2.0

Student answer: Quick sort is to find a pivot elemnt then comparing the elements if greater put right side else left side.
Score: 2.0

Student answer: 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. 
Score: 2.5

Student answer: \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 
Score: 2.0

Student answer: 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 the left partition\nAfter this we will recursively sort the array.
Score: 2.0

Student answer: 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.
Score: 1.0

Student answer: 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
Score: 2.5
Question: How quick sort works?
Reference answer: 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.

Student answer: 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 right places until the array is sorted.
Score: 2.5

Student answer: 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.
Score: 2.0

Student answer: 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
Score: 2.0

Student answer: 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.
Score: 2.5

Student answer: 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.
Score: 2.0

Student answer: Quick sort firstly select a pivot point and then place that selected pivot point at its correct location. 
Score: 1.0

Student answer: Quick sort works by breaking an array into smaller ones and swapping the smaller ones depending on the element picked.
Score: 1.0

Student answer: 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.
Score: 2.5

Student answer: 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.
Score: 2.0

Student answer: 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.
Score: 1.0

Student answer: 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.
Score: 1.0
Question: How quick sort works?
Reference answer: 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.

Student answer: 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 after the partition element.
Score: 2.0

Student answer: 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 too till they become sorted.\n4. The sorted arrays are then combined and we get whole array sorted.
Score: 2.5

Student answer: 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
Score: 2.5

Student answer: Quick sort works according to divide and conquer approach, in this sorting method we make the use of \
Score: 1.0

Student answer: 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
Score: 1.0

Student answer: 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 not necessary in the sorted increasing order at first). Then we recursively call the quick sort algorithm for both the left and the right sides of the array. After this the array is sorted in an increasing order.
Score: 2.5

Student answer: 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 correct position. 
Score: 1.0

Student answer: 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
Score: 1.0
Question: How quick sort works?
Reference answer: 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.

Student answer: 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 working of quick sort in a nutshell.
Score: 2.0

Student answer: 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.
Score: 1.0

Student answer: position indexing
Score: 2.0

Student answer:  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
Score: 2.0

Student answer: 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. 
Score: 1.0

Student answer: 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).
Score: 2.0

Student answer: 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.
Score: 1.0

Student answer: 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.
Score: 2.0

Student answer: 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.
Score: 2.0

Student answer: 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. 
Score: 2.0
Question: How quick sort works?
Reference answer: 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.

Student answer: 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 sort,we divide the array in two parts- sorted and unsorted. We place the elements one by one from the unsorted part to the sorted part in their correct position
Score: 2.0

Student answer: Pivot is selected from the array. Then the array is divided into three parts cotaining elements less than, equal to, greater than the pivot. 
Score: 1.0

Student answer: 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.
Score: 2.0

Student answer: It works by selecting a pivot element and breaking the array into smaller parts 
Score: 2.0

Student answer: 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.
Score: 2.0

Student answer: 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 left and right parts of the array.\nStep 4: Continue this until the base case i.e. Size of array is 0 or 1 is met 
Score: 1.0

Student answer: 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.
Score: 2.0

Student answer: 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 pivot element in role as it is already sorted. Then we will apply recursion on both arrays, and the process goes on and we get a sorted array. Time Complexity - O(nlogn).
Score: 1.0
Question: How quick sort works?
Reference answer: 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.

Student answer: 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.
Score: 2.0

Student answer: it works on divide and conquer. array is divided on pivot element then the each part is sorted separtly .
Score: 1.0

Student answer: Quick Sort works on the basis of position indexing.\nThe position array is created which is then converted into sorted array using the indexes.
Score: 2.0

Student answer: )
Score: 0.0

Student answer: It works by partitioning an array into smaller arrays and exchanging the smaller ones, depending on a comparison with the 'pivot' element picked up.
Score: 1.0

Student answer: 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 and array gets sorted.
Score: 2.0

Student answer: 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.
Score: 1.0

Student answer: 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.
Score: 1.0

Student answer: 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)
Score: 2.0

Student answer: 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 . 
Score: 1.0

Student answer: 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.
Score: 2.0

Student answer: quick sort works divide and conquer method.
Score: 1.0

Student answer: 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
Score: 2.0
Question: How quick sort works?
Reference answer: 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.

Student answer: 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 1st and 3rd parts, hence giving us a sorted array.
Score: 1.0

Student answer: 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.
Score: 2.0

Student answer: 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
Score: 1.0

Student answer: 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.  
Score: 1.0

Student answer: 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 elements occurs in the array
Score: 2.0

Student answer: 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 other elements are sorted.\nhowever both have same time complexity of n square. 
Score: 1.0

Student answer: quick sort works by creating partitions 
Score: 1.0

Student answer: 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 . 
Score: 1.0

Student answer: 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
Score: 2.0

Student answer: Most efficient algorithm. It Works by partitioning an array into smaller ones and swapping the smaller ones depending on comparison with the pivot element.
Score: 1.0
Question: How quick sort works?
Reference answer: 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.

Student answer: 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.
Score: 2.0

Student answer: 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.
Score: 1.0

Student answer: 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. 
Score: 2.0

Student answer: 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 left and right one to sort the entire array.
Score: 2.0

Student answer: 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. 
Score: 2.0

Student answer: 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
Score: 2.0

Student answer: 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.
Score: 2.0

Student answer: 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 swapping the elements. The process is repeated again and again taking different partitions until the whole array is sorted.
Score: 2.0
Question: How quick sort works?
Reference answer: 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.

Student answer: 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(nlogn) while in worst cases it can go to the O(n^2).
Score: 2.0

Student answer: 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;
Score: 2.0

Student answer: 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 
Score: 2.0

Student answer: 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.
Score: 2.0

Student answer: 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. 
Score: 2.0

Student answer: 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.
Score: 2.0

Student answer: quick sort is sorting technique which sort the array by comparing the least element with every element.
Score: 2.0

Student answer: Quick sort works on the principle of divide and conquer and has Time Complexity of O(nlogn). it works by having three pointers. one will point at pivot. the other at beginning and the other at end of array. Pivot can be beginning, end or middle (any) element. i moves from right to left. j moves left to right. when the cross the elements are swapped and elements reach their correct place. Multiple iterations of the same result in sorting of the array. In each iteration the size of the array we are working with gets reduced as we dont need to look at the already sorted part. 
Score: 2.0

Student answer: Quick sorts follows divide and conquer algorithm. We take a pivot element  and the elements smaller than the pivot element are brought to the left of it and the greater are brought to the right of it. and as soon as the pointer for bigger element surpasses the smaller one , the element pointed by the small element pointer becomes the pivot. This is done till the array is sorted.
Score: 2.0

Student answer: quick sort uses divide and conquer approach it picks a random element and then divide the array around it.
Score: 2.0
Question: How quick sort works?
Reference answer: 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.

Student answer: In quick sort we use two pointers one for left and other for right left pointer traverse from left to right and right traverse form right to left.\nWe select one pivot element and if [key+left]/2<mid then pointer then left pointer move towards right and if [key+left]/2>mid then second pointer moves from right to left.
Score: 2.0

Student answer: QuickSort is a Divide and Conquer algorithm. It picks an element as a pivot and partitions the given array around the picked pivot. There are many different versions of quickSort that pick pivot in different ways
Score: 2.0

Student answer:  It works by dividing an array  into smaller arrays and changing he smaller arrays , depending  on the pivot that is taking element from both the  arrays are either incremented or swapped accordingly with smaller element present in the first array.
Score: 2.0

Student answer: quick sort works work divider and conquer algorithm\nit is a sorting technique to sort the data accordingly
Score: 2.0

Student answer: In quick sort we use to take a pivot to sort the whole array. we use to take  a pivot and compare it with the next element if the elment is small than we use to change the position of the element with the next one.
Score: 2.0

Student answer: quick sort breaks an array into smaller arrays and then swaps the smaller ones, by comparing with the adjacent element.
Score: 2.0

Student answer: quick sort works with the help of a divide and conquer algorithm. Here we take the help of a recursion.\nHere first we find a partition element then we place it at its correct position then we sort the elements present before the partition elements and the elements after that partition element with the help of recursion and divide and conquer algorithm.
Score: 2.0

Student answer: you select a element as the pivot and put all the elements in their correct places with respect to the pivot that and do it recursively until the array becomes sortes
Score: 1.0

Student answer: We choose a pivot element and place all the smaller elements to the left of it and all the larger elements to the right of it. Then using divide and conquer we break the array from that element in two parts and solve both arrays using recursion using same method. 
Score: 2.0

Student answer: Quick sort works by taking one element at a time(pivot) and then placing it in its correct postition then calling the function recursively for this elements left and right side
Score: 1.0
Question: How quick sort works?
Reference answer: 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.

Student answer: Quick sort works by the method of divide and conquer . An index called pivot is first taken then the array is divided into 3 parts . 1st where the elements are smaller than the one at pivot ,2nd where the elements are equal to the one at pivot and 3rd where the elements are greater . now at each step the quick sort is called recursively for each of the part . And then finally the we get sorted array at the last and the recursion is called back.
Score: 2.0

Student answer: divide and conquer
Score: 1.0

Student answer: so in a quick sort first of all we take up any element as pivot element .\nthen we form a partition where all elements smaller than pivot element is put to the left of it and all elements greater are put to the right of it.\nthen we start comparing and placing every element to its correct position .\nit works in O(nLOGn) time.
Score: 1.0

Student answer: Quick sort is a sorting technique in which we first select a random element in the array which we call as pivot element and then we put all elements which are smaller than pivot in its left and bigger in right this places our pivot element at its correct position. Then we se;ect another pivot in left and right side so to sort the whole array. Its average time complexity is O(nlogn) and worst case is O(n^2).
Score: 1.0

Student answer: The function of quick sort is to sort the given array in O(n*logn) time complexity. \nIt uses the divide and conquer approach to solve the problem. An element is taken from the given array and then compared with all the elements by finding the largest element in each traversal and then placing that largest element in the last of the array. The loop runs till the count of the elements. And in such manner quick sort works.
Score: 2.0

Student answer: quicksort follows divide and conquer algorithm. in which we select a pivot element and arrange the element lesser than it in left and greater than it in right to sort thr element.
Score: 2.0

Student answer:  The algorithm picks a pivot element and rearranges the array elements so that all elements smaller than the picked pivot element move to the left side of the pivot, and all greater elements move to the right side. Finally, the algorithm recursively sorts the subarrays on the left and right of the pivot element.
Score: 1.0

Student answer: in quick sort we pick an element in random and check the number of elements smaller and larger than it \nthan we put the chosen element in its position in the array (if it were sorted)\nthan all the elements that are larger than it are put to its left side and the larger elements on the right side\nand we call the function for the left part of the array and the right part of the array
Score: 1.0
Question: How quick sort works?
Reference answer: 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.

Student answer: Quick sort works on partition theorem (Lomuto,Hoare partition theorems)\nin quick sort array is partioned about an any element (mainly first and last) and then recursive call done for two arrays while is the part of main array that is divided due to the pivot element and we repeat process untill 1 element left after that we get the sorted array
Score: 1.0

Student answer: element is put in on its position and on left small elememts are kept and on right greater elements than the elements are put and for other elements recursion is called
Score: 1.0

Student answer: Linear searching is a simple method of searching whether an element exists in any particular data structure, It takes the required element and compares it with each of the element present in the data structure. If found. it gives us the required result .
Score: 1.0

Student answer: It works by breaking an array into smaller ones and swapping the smaller ones depending upon comparison with pivot element
Score: 1.0

Student answer: We get a random data from amongst the array of data available. Then we compare the value of this data with the other datas. Then we divide the array into two factions, then repeat the above procedure until we are left with NULL. Then we combine the elements in  the order that they were divided and we have the sorted array.
Score: 1.0

Student answer: In quick sort technique we first choose an element from our array as a pivot element. Then placed the elements such that the elements which are smaller than the pivot element should placed on the left of it and elements which are greater should be on the right of it.
Score: 1.0

Student answer: Quick sort is sorting technique which basically works on divide and conquer approach it find pivot element and arrange element on left and right according to the pivot.Then pivot element for two partitioned arrays are generated till the array is sorted.  
Score: 2.0

Student answer: Quick sort works on the principle of divide and conquer.It first divides the problem into smaller smaller problems,solves those and then combines those smaller problems that is it divides the array to be sorted in smaller arrays and then combines those smaller sorted arrays to get the sorted array as the solution.
Score: 2.0

Student answer: In this we take a pivot element randomly and we place all the elements in either left or right of the pivot and hence we find the sorted array. 
Score: 2.0

Student answer: quick sort is based on divide and conquer technique its working is as follows:-\n1-in quick sort we randomly select a pivot element from the data\n2-we find all the elements less than and greater than pivot\n3-then we place the pivot at its correct position\n4-then we call recursion
Score: 2.0
Question: How quick sort works?
Reference answer: 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.

Student answer: a pivot element is chosen randomly from the set of elements and all the other elements are placed either to the right or left to this pivot element
Score: 2.0

Student answer:  <<endl;\n  }\n}\n\n
Score: 0.0

Student answer: quick sort works on the principle of divide and conquer . in quick sort we find the pivot element and it is placed at its correct position when we call it recursively
Score: 1.0

Student answer: Quick sort works by finding an element known as pivot whose correct position in the array/vectors is obtained  and is placed according to it's correct position. Now the elements less than this pivot element are placed before it and  greater/equal elements are placed after it. This repeats for the smallest size array to the biggest and thus sorting is performed in O(n log n ).
Score: 1.0

Student answer: follows divide and conquer approach, in which we break down the array into single element then perform some operation on these elements, and at the end we have our data sorted.
Score: 2.5

Student answer: quick sort work by finding the position of piviot element and sorting accordingly and doing this in reccursive manner.
Score: 2.5

Student answer: In the array first we take the middle term as pivot or the last term as pivot .then here two array will be created that the parting of the array and compare the arrays rem one by one with the pivot and give in final array and that array will be sorted in the partition of an array is the approach  
Score: 2.5

Student answer: in each iteration, an element is picked and it is swapped till it reaches its correct position in the array, that is, greater elements are on the right and lesser elements go to the left.
Score: 2.0

Student answer: In quick sort we run a iterator and compares the every element starting from the index 0, whenever the value of right index surpasses the value of its imediate left index we swap them. We perform this process again and again until we get a sorted array.
Score: 1.0

Student answer: quick sort finds the correct position of a pivot element from unsorted array in the sorted array and place it at that position and in this way it finds the correct position of each element and hence, sorts the array
Score: 2.5

Student answer: Quick sort works by selecting an element as pivot and sorting array around the value of the pivot such that the value greater than the value of pivot come after index of pivot . Then updating the pivot and again following the same procedure till the array gets sorted.
Score: 2.5
Question: How quick sort works?
Reference answer: 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.

Student answer: there are different of sorting like Merge sort,quick sort etc.\nsorting is basically the way to sort given array in different ways like in merge sort we divide the array in two equal parts till it reaches upto single values \nsimilarly quick sort works in a way that we have to compare first element to every other element if it is smaller then we have to add it in the last and check for another element and compare it to every other elements and so on
Score: 2.0

Student answer: quick sort divide the array in two parts than sort both parts in a order
Score: 2.5

Student answer: Quick sort works by first partioning the array about a pivot element(random element from the array) so that the pivot element comes to its correct position where it should be in a sorted array. And a recursive function should be runned from low index to pivot index and pivot+1th index to high index in a recursivfe manner so thaat every time the recusion is done pivot comes to its right position and at the end we need to swap the pivot with high element in order to get a fully sorted array.
Score: 2.5

Student answer: in this we select a pivot element and then acc to this pivot element we divde the array and sort it in 2 parts and then doing this recursively
Score: 2.5

Student answer: it works on the concept of divide and conquer it first sets the pivot element and the one by divide elements into subarrays by using pivot and then compare elements on the most basic level
Score: 2.5

Student answer: Quick Sort function utilizes the use of partition function which actually selects a random element from the array and place it according to logographical order then elements smaller than it are placed on the left and vice versa with the larger elements, partition index is returned for which the quick sort is called two times one for start to pI and from pI to end.\n
Score: 2.5

Student answer: in this we select the priort element and acc to this priot element we divide the list in 2 parts 
Score: 2.5

Student answer: Quick sort first partitions the array about the pivot element. It then puts all the elements less than the pivot element before it and all elements greater than pivot element after it in the array.This runs recursively until entire array is sorted.
Score: 2.5

Student answer: in quick sort a pivot is selected \nthe i+1 th elements is compared with ith item\nif i+1<i then we swap\nwhere i =selected pivot
Score: 2.5

Student answer: sorting is used to do simply things, quick sort quickly sort all the functions, entities in the program
Score: 0.0

Student answer: selecting the middle element of an array as pivot \nkeeping the smallest to pivot the left and larger on the right \nsorting both arrays separately and at last place the pivot on it's position 
Score: 2.5
Question: How quick sort works?
Reference answer: 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.

Student answer: Quick sort first partions the array in two different part and then it sorts the elements in such a way that the element to the left of pivot (partition point) is smaller and to the right is is biggger.
Score: 2.5

Student answer: in quick sort their is three things are given one is first  sub array and middle pivot element and second sub array. and we move in two loops to check the value that the element is lesser or greater than pivot element.
Score: 2.5

Student answer: quick sort work in time of (log n) it works on the concept of divide and conquer method to achieve a particular result in the given array \nso firstly it divide the hole array into a single  element and the sort it on the bases of ascending order   and then give a desire result  
Score: 2.5

Student answer: Quick sort randomly selects a pivot element and divides the structure according to it. The elements that are smaller than that goes to the left and the elements bigger goes to the right. It then keep dividing them further in the same manner till single elements remain and then starts merging them to form the final sorted result.
Score: 2.5

Student answer: in quick sort first we take a pivot element and then compare it element starting from right and left \nif the left one element is smaller then we replace it with greater and if right one element is smaller then we shift the pivot element  to it
Score: 2.5

Student answer: a quick sort first sort the given array the find the pivot  from the given element and the compare it from all elements and by this process we find and sorted and  optimal array.
Score: 2.5

Student answer: first a pivot element is to be chosen then, elemnts get indexed or traversed as per its order means element grater or less than the pivot element 
Score: 2.5

Student answer: In Quick sort. \n1. We define a pivot element and start comparison from right to left.\n2. If left element is smaller than we replace it with the greater element \n3. If the right element is smaller than we shift the pivot element to it.
Score: 2.5

Student answer: quick sort we compare the element from starting index 0 and compare the element such that we swap the two elements if they arent in order then we compare the next element in the array then we again compare the previous ad the first element and so on.
Score: 0.0

Student answer: in quick sort two pointers are taken and one pivot point is taken we put conditions for elements if the right pointer satisfy the condition then it shift toward left, if pivot is being crossed then both values are swapped.
Score: 1.0