Harsh-7300/dataset huggingface dataset:
Question: How insertion sort and selection sorts are different?
Reference answer: Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list

Student answer:  at each and every position of the array and if value of any position == a, then we need to return it. This is what called linear searching. 
Score: 1.0

Student answer: insertion sort : first element is key and the next element is checked while it is smaller than key based on that pushes it towards the front of the array.\nselection sort : this technique is based on swapping principle wherein it linearly picks one element and searches the smallest element in the entire array.\nselection sort checks the entire array always but in insertion sort only the key and the next element is checked hence in the best case the complexity of the insertion sort turns out to be O(n) while in selection sort it is O(n^2)
Score: 2.0

Student answer: In insertion sort , the elements are inserted at the start and then positioned according to the increasing or decreasing order. While in selection sort , the entire array is traversed and checks for its position. Both have different time complexities. 
Score: 1.0

Student answer: In insertion sort, we simply divide our data structure in two parts one is sorted and second unsorted. And then add first element in sorted one and assume that it is sorted and then we traverse our data structure and update the the two parts on traversing . It is like how we arrange playing cards. \n\nIn selection sort, we select one element and compare it with every element present in data structure and place it at its desired position. Then take another and repeat the process until the array is sorted.\n
Score: 1.0

Student answer: in insertion sort we take the first element as key and check with the next element and keep on repeating. while in selection sort we take the first element and check it with the whole array to decide its position in the array and keep on repeating the process.
Score: 1.0

Student answer: insertion sort takes a new blank array and then places the elements in sorted order in the array. It picks up the array elements of the given array one after the other in the given order.\nselection sort on selects the elements of the given array and sort them in the given array itself.
Score: 1.0

Student answer: Insertion sort is the sorting algorithm which uses the card method of sorting in which means put the element at its correct location with simultaneously using the swap.\nSelection sort is the sorting algorithm which finds the minimum element in the entire array and then insert it to the first position and we simultaneously increse the first index and search minimum again in the array available after the position and when the end is reached then the algorithm stops.
Score: 1.0
Question: How insertion sort and selection sorts are different?
Reference answer: Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list

Student answer: in insertion sort you take a element and compare it with all the elements occurring before it in the array and place it accordingly in the array and repeat if for rest of the elements\nin selection sort you select a element and place it at specific position it should have in sorted array
Score: 1.0

Student answer: They are different based on their worst case time complexity.
Score: 1.0

Student answer: in insertion sort it divides the array and then place the first element on the right place in first array, and then increasing the size of first array it keeps on repeating the same process until it reach the end of array, however in selection sort , it will find the lowest or highest element and replace it by first element then the pointer keeps on moving to the next array finding the suitable element and swapping it in the end and at last we get the sorted array.
Score: 1.0

Student answer: Insertion Sort has a pivot while selection sort does not have a pivot. 
Score: 1.0

Student answer: Linear searching is a way of searching in an array which takes O(N) time. In this type of searching, we iterate the array and check whether the required element is present in the array or not. If the element is present, it returns 1 else it returns 0(if boolean function of linear searching is made)
Score: 1.0

Student answer: Insertion sort and selection sort works differently as in one chooses a pivot and sorts accordingly while the other doesn't.
Score: 1.0

Student answer: insertion sort have time complexity of O(nlogn) whereas selection sort has time complexity of O(n)
Score: 1.0

Student answer: In insertion sort when we find the element greater let us say B from an element A then we insert B right after A shifting the rest of the array by one place making room for B. In selection sort we swap instead. So the difference is in the swapping. 
Score: 1.0

Student answer: In insertion sort, the smaller elements are moved to the left and the bigger elements to the right.\nTime complexity = O(n) in best case\nIn selection sort, each element is compared with the rest of the elements in the list/array and the smallest is brought to the front.\nTime complexity= O(n^2) in best case
Score: 1.0

Student answer: in selection sort we find the exact position of the data and in ins
Score: 1.0

Student answer: In inser
Score: 0.0

Student answer: In Insertion sort, the element is picked and placed as per desired neighbor set\nWhere as, In Selection sort, we find the exact place of the selected data
Score: 1.0
Question: How insertion sort and selection sorts are different?
Reference answer: Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list

Student answer: In the selection sort we find the min. number from the given array of list and sort them in order while in the insertion sort  we insert the values in an array and save it in another array to sort a set of values. 
Score: 1.0

Student answer: selection sort uses the approach of divide and conquer on the problem statement to solve it as parts and later combine them later when the task is complete , while insertion sort works in a different manner.
Score: 1.0

Student answer: As the name suggests insertion helps in inserting the given data and then sorting accordingly unlike selection sort helps in choosing the data we require to find
Score: 1.0

Student answer: In insertion sort we use to insert the data and directly arrang them in the sort way. And in selection sort we use to sort the particular data that is already inserted. 
Score: 1.0

Student answer: insertion sort inserts values in a already sorted file to sort a set of values. whereas, selection sort finds the minimum number from the list and sort it in a given order. 
Score: 1.0

Student answer: in insertion sort you put every element at its correct position and in selection sort you find the next min or max element in rest of the array and swap it with the current element
Score: 1.0

Student answer: In insertion sort, we take an element from an array and insert it in the correct position of an array and it is a linear search. in this we divide array into sorted and unsorted and take the first element and sort them into the unsorted array\nIn selection sort, we divide array into sorted and unsorted array and pick an element and put it into the sorted array into the correct position. it is a divide and conquer approach
Score: 1.0

Student answer: in selection sort we use two for loops to find the position of a element one by one, whereas in insertion sort we can exchange two continous element depending on which is smaller, and we keep on doing this until the array is sorted
Score: 1.0

Student answer: Insertion sort and selection sort are two popular sorting algorithms, and their main difference lies in how they select and place elements in a sorted sequence manner.
Score: 1.0

Student answer: basic difference between the two is thst selection sort is a linear sort which runs on comparing each element with one predefined minimum or maximum element whereas insertion sort works on divide and conquer technique.
Score: 1.0
Question: How insertion sort and selection sorts are different?
Reference answer: Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list

Student answer: Selection sort is a technique in which we find out the smallest element in whole array and swap it with element present at 1st position and so on till the end, so it takes O(n^2) time, whereas insertion sort is a technique in which you assume that only first element is present first and for second element you shift according to first element by comparing whether it is smaller or big just like sort a pack of cards by picking card one by one it's time complexity is also O(n^2).
Score: 1.0

Student answer: time complexity of insertion sort is O(n*n) as two for loops are used in it. It takes the element which is present in the first index than it compare with other elements than perform the swap operation at each index.\nwhereas Selection sort compares the two adjacent element and perform the swap operations , it also has the time complexity of O(n*n).
Score: 1.0

Student answer: in insertion sort we insert the element in correct position iteratively and in selection sort we comapre to element to place a element in correct position iteratively.
Score: 1.0

Student answer: In selection sort, the input array is divided into two parts: a sorted part and an unsorted part.\nThe algorithm repeatedly finds the minimum element in the unsorted part and swaps it with the leftmost element of the unsorted part, thus expanding the sorted part by one element.\nSelection sort has a time complexity of O(n^2) in all cases.\nInsertion Sort:\nIn insertion sort, the input array is also divided into two parts: a sorted part and an unsorted part.\nThe algorithm picks up an element and places it at its correct position in the sorted part as soon as it is added.
Score: 1.0

Student answer: in insertion sort we pick the min element and put it in front of our array and repeat the process for remaining\n\nin selection sort we pick the adjacent elements and compare them and swap if first element is bigger than the second than we perform swap operation on them
Score: 1.0

Student answer: In insertion sort we find the minimum element and place it to its correct position and decrease the size of traversing array\nIn selection sort we find the maximum element and place it to its correct position and decrease the size of traversing array
Score: 1.0

Student answer: in insertion sort we basically insert elements in the starting by removing elements from the last and applying the sorting algorithm \nand in selection sort we basically make the adjacent swaps and apply the sorting algorithm
Score: 1.0
Question: How insertion sort and selection sorts are different?
Reference answer: Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list

Student answer: Queues work in the way of LIFO (Last in first out ) method. It is a data structure which is used to efficiently manipulate data in a way such that the element on the top of the stack goes out and when output is displayed or accessed and there when we input any element in the stack, it goes on last of it. Any algorithm or problem which benefits from the same uses Queues. \nOperations like accessing the top element in the data structure, removing it , manipulating/changing it, inserting elements on the end of it etc. can be performed. Pop, push etc.
Score: 1.0

Student answer: The insertion sort inserts the values in a presorted file to sort a set of values. On the other hand, the selection sort finds the minimum number from the list and sort it in some order.
Score: 1.0

Student answer: In selection sort. We traverse through the array O(n2) times. In each traversal we make the smallest/largest data to reach the end of the array by performing swapping action. This way, we sort.\nIn insertion sort. We assume that the first element is the smallest/largest element. And then we compare it with the upcoming elements, performing swapping wherever and whenever necessary. The worst case for this sort is also O(n2), but the best case can be linear time as well.
Score: 1.0

Student answer: In Insertion sort we pick an array element and insert it by comparing it with all other elements of that array.\nIn selection sort we keep comparing each element with its next element and if it smaller than we placed it in the starting index of the array and do this again for the next elements.
Score: 1.0

Student answer: In Insertion sort, a element is selected and is placed at its right position it is done till all elements are at their correct position  for eg. arranging deck of card\nwhereas in selection sort  we sort element 
Score: 1.0

Student answer: In insertion sort,an array is traversed 
Score: 1.0

Student answer: In insertion sort we select one element and perform certain operations on it till it gets to the right position and this process if performed on all the elements.\n
Score: 1.0

Student answer: in insertion sort elements are inserted at their correct position just like we arrange playing cards in our hands \nwhereas , in selection sort we pick one element and place it at its correct position.
Score: 1.0

Student answer: << i << \
Score: 0.0

Student answer: in insertion sort we place the element at starting position by comparing and swapping it with other elements and repeat the process to do sorting.\nin selection sort we select an element and place it at its correct position and repeat the process to do sorting.
Score: 1.0
Question: How insertion sort and selection sorts are different?
Reference answer: Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list

Student answer: Insertion and selection sort are different in manner of sorting method they use. In insertion sort a single  element is inserted first and then other elements are inserted according to their momentarily correct position by comparing with elements already inserted. While in selection sort we take out an element and place it in it's correct position and repeat the process accordingly.
Score: 1.0

Student answer: in insertion sort is a type of sorting in which we take an element from the array then we find then we insert it at it's correct position. In selection sort we pick an element and then find it's correct position and then interchange it. In selection sort we run a nested loop which the outer loop runs from start to end of the array and the inner loop runs from i th to n-1 th position of the array,which is not the case in insertion sort.
Score: 2.5

Student answer: In insertion sort, we start by taking the first two elements of the data structure and sort it, then we take first three elements and sort it, and so on ,till the last element is reached.\nIn selection sort, we set the first element as minimum element , then we compare it with next element, and if the next element is smaller then these two will be swapped and it will become the new minimum element. this process will go on till all sorting is done.  
Score: 1.0

Student answer: in the insertion sort the sorting the array with taking the two index and making a for loop and interchange the value with the other one which ore shorter. while in selection sort the sorting the algorithm with one index and finding the sorter tern of array with the help of loop and select it and take it as a first index .\nAlso both have different time complexity.
Score: 1.0

Student answer: in insertion sort, we need to insert the existing elements to a new array, in such a manner that the new array is sorted at each step.\nin selection sort, we select the smallest element in the array and then swap it with the first element, then we look for second smallest and swap it with second element and so on.
Score: 2.5

Student answer: In insertion sort we select a pivot point which keeps on changing while in selection sort we select a middle element and keeps comparing the other elements from it.
Score: 0.0

Student answer: In insertion sort we insert the new element in the already sorted part of the array one by one till the complete array is sorted whereas in selection sort 
Score: 1.5
Question: How insertion sort and selection sorts are different?
Reference answer: Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list

Student answer: Insertion sort swaps the element with the  next element if the value of the next element is smaller and swaps many times in a single loop.\nBut is case of selection sort the minimum element is selected in single loop and after one loop is over the element is swapped.
Score: 1.0

Student answer: Insertion sort divides and insert the given value while selection sort selects the value which is required
Score: 2.5

Student answer: in insertion sort we sort the array in ascending order \nwhile in selection sort we sort the array in descending order\ninsertion sort time complexity o(logn)\nselection sort o(n)
Score: 0.0

Student answer: Insertion sort compares one element to every other elemt and swaps if value is greater or smaller.
Score: 0.0

Student answer: In insertion sort one pointer is place at the starting index and other pointer is placed at the next index and swapping is done by comparing the other index element with elements within that particular bracket of first index and the other idex which increases as every time the otherv pointer shifts to the right. On the other hand selection sort is done by placing apointer at the first index and other pointer at the last index and swapping is done by comparing the two elements till the time both the pointers meet or cross each other.
Score: 1.0

Student answer: in insertion sort  a kind of new auxillary  data structure is created and then data is inserted one by one where as in selection sort data is selected on different indices. they also have different time complexities.
Score: 2.5

Student answer: Insertion sort assumes that initially there is no element present in the array and we add elements one by one and compare it with the previous one that are being added whereas in case of selection sort
Score: 1.5

Student answer: In insertion sort, swapping is used to sort the array.\nIn selection sort, minimum element(of reamaining array) is found out each time and put at the starting index.
Score: 1.0

Student answer: in insertion sort selected item is compared to the next item in iteration\nin selection sort two items in the list are compared if prev is greater than the next then we swap
Score: 1.0

Student answer: insertion sort:- traversing the array and putting the smallest element on the first position and so on\nselection sort:- selection the smallest in the pairs of 2 i.e running 2 loops i and j one starting with 0th position and other from 1st
Score: 1.0
Question: How insertion sort and selection sorts are different?
Reference answer: Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list

Student answer: In Insertion sort , at first we traverse the whole array and find the 1st minimum element and place in it correct place , and we find the second minimum element place it in correct place and we do until the whole array is sorted.\nIn selection sort , we take two pointers and compare them , if the first element is bigger we swap it otherwise we increment the pointer. we do it until awhole array is sorted
Score: 2.5

Student answer: Insertion Sort and Selection sort are different in terms of their time complex-cities. Selection Sort is the most efficient and less time consuming in terms of solving aproblem.
Score: 0.0

Student answer: in insertion sort we insert the value one by one by comparing not only one but also with another one. selection sort is the sort which used sort by comparisons
Score: 0.0

Student answer: in 
Score: 0.0

Student answer: Insertion sort keeps on inserting the right elements one by one in the data structure while selection sort selects the data and compares it to the elements and then put it accordingly.
Score: 2.5

Student answer: insertion  sort just compare the values and insert the values and selection sort is similar as quick sort
Score: 2.0

Student answer: insertion sort is used when the array is completely sorted where as selection sort is used when the array is partially sorted
Score: 0.0

Student answer: selection sort is a sorting technique in which we select an element and compare it to the array, till it reaches the correct position we do it with every element in an array.\ninsertion sort we create another array and sort the elements.
Score: 0.0

Student answer: in insertion sort element is being inserted at the end and in selection sort element inserted at random. 
Score: 0.0

Student answer: in insertion sort we insert data in the given array according to question\nand in selection sort we select the data which is mentioned in the ques from the given array
Score: 0.0

Student answer: In insertion sort, we select the element in the unsorted part of the array and then position it at the correct position in the sorted part of the array.\nIn selection sort, we find the minimum or maximum element in the array, swap it and then again repeat the process until the array is sorted
Score: 2.5

Student answer: Insertion sort and selection sort are different by the operation they performed as selection sort is used to select the element from an array and insertion sort is used to insert an element in an array. 
Score: 2.0

Student answer: in insertion sort we assign pre value to max and min and then change them accordingly after comparison\nselection sort have more time complexity
Score: 0.0
Question: How insertion sort and selection sorts are different?
Reference answer: Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list

Student answer: in insertion sort we insert element first and arrange in right manner , but in selection sort we first select the elements and then sort in right way
Score: 2.0

Student answer: insertion sort is faster than selection sort\nin selection sort, the digits are compared with each other and then swapped\nin insertion sort a formula is used.\n
Score: 0.0

Student answer: insertion short and select short are different because we give in put to both of them by the different method 
Score: 0.0

Student answer: in terms of time complexity,\ninsertion sort words better than selection for smaller frequency values\nand selection works better for larger freq of values\nbut it is seggested to use selection sort
Score: 0.0

Student answer: insertion sort break the array then assemble in sort and in selection sort in we select in element and compare and sort them
Score: 0.0

Student answer: in insertion sort we can insert the value & when the array is partially not defined in selection sort.
Score: 0.0

Student answer: the number of comparisions in selection sort is less than insertion sort 
Score: 0.0

Student answer: in insertion sort, we just compare the value to the last of the array value and interchange if needed, like we just compare , traverse and edit the array, \nin selection sort, we divide the array into two equal parts and start comparing using a pivot element in the given array.
Score: 0.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 uses a partition index where where all the elements on the left side of the partition are smaller than the partition elemnt, this process is repeated till the array is sorted. The partition element is chosen accordingly.
Score: 2.5

Student answer: in quick sort firstly we pick one pivot element generally the first one and then compare it with the neighbour of it if the element which is found is less than the pivot element we swap the values and likewise we compare it with other elements and if the element found is greater than the pivot element  then we don't swipe and finally after performing this at end we get a sorted array
Score: 2.0

Student answer: if we have an array of n elements so first we point l to the first element of the array and h to the last element of the array then we take the mid by l+h/2 \nif mid=desired element exit we found the element if mid is less than the desired element then we will make h=new mid and then we will find the mid again till we find the element \nif mid is greater than the element we will make l=mid and then recusivly this will go on  till we find the element
Score: 2.0

Student answer: Quick sort is a divide and conquer element, it takes a random pivot element and compares it with other elements and then swaps there positions
Score: 2.0

Student answer: Quick sort is a divide and conquer algorithm. It starts by picking a pivot element. Then it compares the elements with the pivot and swaps the posititons. It uses this pivot to divide the list or array and then recursively calls itself for each  divided part.
Score: 2.0

Student answer: Quick sort is used to sort an array in logn time complexity. \nFirstly here we tried to find a pivot element , it may be first , last , middle or may be a random element .\nThen we have two pointer one at first and last element of array then we compare elements to pivot element and tried to place elements smaller than pivot before than pivot and larger than pivot till we starting pointer comes to end and end pointer comes to start. After that we got a sorted array.
Score: 2.5

Student answer: a quick sort  is one of the most efficient sorting algorithm. it works by breaking the array into smaller ones and swapping the smaller ones depending on comparison with the pivot element picked. 
Score: 2.5

Student answer: Quicksort\n. Pick an pivot element \n. Divide the array in three parts.\n. Left side if the elements are less than pivot element.\n. Element equal to pivot element.\n.Right side if elements are more than pivot element.\n.Then apply quicksort on the three subparts.
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: -> Quicksort firstly picks up an pivot element from the list \n-> Then is divides the list into three sub lists 1. element lower than pivot element 2. elements equal to pivot element 3. elements greater than pivot elements\n-> Then it does the same for th
Score: 2.0

Student answer: quick sort is a Divide and Conquer algorithm. It picks an element as a pivot and partitions the given array around the picked pivot
Score: 1.0

Student answer: It works on divide and conqueror approach whole array is divided by choosing an element as pivot and then elements less than pivot are in one array and element grater than or equal to pivot are on other side ,when only 2 elements are present in array after dividing ,using the Partition function we sort the array and solve the smaller part of the question so that to get the solution of whole problem.
Score: 2.5

Student answer: Quick sort 1st divide the array and traverse it from both the side if it found the element  greater then from there is  again breaks the array and do it till the heaviest element comes at start and lowest at end and then merge the array again , basically it uses divide and conquer approach .
Score: 2.5

Student answer: Quick sort works on divide and conquer method , first it divide the given array in two and then further dividing it until it consist two values which are then sorted the given array and then again adding together to form the sorted array.
Score: 2.0

Student answer: Quick Sort is based on divide and conquer mechanism , we take a pivot element and two pointers on either end of the array. The pointer on the start (p ) moves towards the left and the one of the end (q) moves towards the right while comparing the values to that of the pivot element. Conditions of pivot  element being greater than value of q or less than q are checked for the pointer to move forward and if the pointers cross each other then the element is swapped with the pivot and this continues till the entire array is sorted.
Score: 2.5

Student answer: quick sort works on the basis of divide and conquer methodology.
Score: 1.0

Student answer: We randomly pick a pivot element \nWe have two pointers front at 0th index, back at (n-1)th index, front pointer will increase and back pointer will decrease.\nElement smaller than pivot element will be placed to the left and element bigger then the pivot element will be placed at right side.\nWhen front > back , front and pivot will swap the element.\nSame procedure will be repeated for left side and right side of the pivot element until array is 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: Quick sort works by creating a partition on an element in the array such that all the elements on the left of the partition are smaller than the partition element and all the elements on the right side are greater than the partition element
Score: 2.5

Student answer: The only difference between insertion sort and selection sort is that of the selecting item.\nIn selection sort, one of the very beginning item is selected and it is compared with all the rest of the items ahead.
Score: 0.0

Student answer: quick sort finds the partition element in the array first or the pivot element mostly the first element.\nthen it place the pivot to its correct position and we passes two recurrences from 0 to partition -1 and partition +1 to last element of the array.\nin each iteration of recurrence all the pivots are places to its correct position thus the array become sorted. partition places to its correct position by shifting the element smaller than it to left and bigger on right.\n\n\n
Score: 2.0

Student answer: Quick Sort is a sorting technique used to sort a list given to us.\nIn quick sort we make a function partition(). We start traversing the list given from the start as well as the end using the variables say, 'start' and 'end' respectively.\nThese two variables act as starting and ending indexes of the values respectively in the list.\nWe also choose anyone element of the list say the starting element and store it in a variable say 'part'.\nWe compare the starting element and ending element with the element stored in variable 'part'. If the starting element is greater than 'part', then we move the start index forward. If the ending element is smaller than part then we move the end index backwards. This way we do until the start and end indexes cross each other, as soon as it does we replace the element at the end index with the element stored in variable 'part'. We proceed in this way till we obtain the sorted list.
Score: 1.0

Student answer: In quick sort we select a pivot element which can be the first , last , middle or any other random element and then we partition the array with the pivot element as the divider.\nWe use divide and conquer algorithm as the basis for doing this sort  then individually we sort the small parts and lastly join them together to get our sorted array.\n
Score: 2.5

Student answer: In quick sort we select a random element from the array which could lie anywhere in the array and then we divide the array with the pivot element at wherever that random element lies. It could be the first , last or the middle 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: Insertion sort and selection sort are sorting algorithms with time complexity of O(n^2). The main difference between these sorting techniques is that in insertion sort, we sort the elements by comparing every element with its neighbors and placing it accordingly in the array. However in selection sort, this is not the way elements are sorted. 
Score: 0.0

Student answer: quick sort take a pivot value and divide the array in such a way the left side al element should be smaller then pivot element and at left of the pivot all element should be greater then  pivot it does this operation in partition function. \nbasically it follows divide and conquer strategy to sort array \ntime complexity : O(nlogn) 
Score: 2.5

Student answer: We take a pivot in the array and we have a partition function. An iterator( i ) moves from the left till it finds and element larger than the pivot and an iterator( j ) moves from right till it finds an element smaller than the pivot. If i> j then we swap the elements if not then the elements remain the same. The pivot is then shifted to the next element in the array and repeating these steps the array gets sort. This is how quick sort works.
Score: 2.5

Student answer: A pivot element is chosen and then two pointers(i and j) are initialized, one which begins from the left of the array and the other which begins from the right. The pointers are traversing trough the array and the elements in the respective position are compared to the PIVOT element. Any element smaller than the pivot is inserted before the pivot. \n
Score: 2.5

Student answer: We take a pivot element and two pointers are taken as reference ( I and j ) which are initialized at the beginning and the end of the array respectively, and move in forward and backward direction ( left to right and right to left). The pointers traverse the whole array comparing with the pivot and place the element correctly by satisfying the given conditions using swap function. \n when array[I] crosses array[j] swap the pivot and position of j pointer. Also when comparing the array if array[I] > array[j] swap the elements and move further.
Score: 2.5

Student answer: In quick sort, an element is taken as pivot and is inserted in its correct position by shifting the smaller elements to its right and the larger ones to its left. In this way the entire array is sorted.
Score: 2.0

Student answer: quick sort has the worst time complexity of n log n which is better than the worst time complexity of merge sort but the best time complexity and average time complexity of merge sort and quick sort are same.
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: The basic steps involved in quick sort is:\n1)partition : we divide the given array in two parts \n2) pivot element: we take pivot element and sort the two different parts\n3) after sorting we merge the two different parts which is already sorted in a new sorted sequence\n  O(n log n )
Score: 2.0

Student answer: quick sort works on the divide and conquer approach where the array is divided in parts using a pivot element which can be in middle ,start or end of the array and then merge in sorted order.
Score: 2.0

Student answer: time complexity of quick sort is - n log(n)\nquick sort is a sorting technique helps to sort out the number in a required order .It makes 2 pointers temp and I for 1st and 2nd element and then check element one by one to know which one is greater than the other if a[i]>a[temp} then swap the function.\n\n
Score: 2.0

Student answer: Quick Sort works using partition method . \nIt uses Divide and Conquer approach.\nIt chooses a pivot element. Then it make comparison with pivot element and further it proceeds with quick sort Algorithm procedure. \nIt takes O(n^2) time. 
Score: 2.0

Student answer: Quick sort algorithm uses divide and conquer algorithm to sort any given array.
Score: 1.0

Student answer: a quick sort works by selecting a pivot element and then arranging the elements according to the pivot element and then again repeating the steps till the array is sorted.
Score: 2.0

Student answer: First we will apply the base case .\nThen we will two temporary pointers first one is for the element from which we will have to start the traversing of the array and next one is for the next element of the previous one.\nlets take them i and j\nin this we have cases when i is smaller than one then just return noting and when they are equal then also return nothing but when i is greater than j then we have to swap it depends upon from which side we are traversing and and in which order we will have to traverse.
Score: 2.0

Student answer: Linear Searching is the process of searching in which we search the elements by traversing all the elements in the given order one by one till the element to be searched is found.
Score: 0.0

Student answer: quick sort uses a pivot element to sort the rest of the elements around it. it moves the pivot element to the right place and lesser elements to the left of it and greater to the right and then applies quick sort again in the left and right sepetrately. Works on divide and conquer algorithm.
Score: 2.5

Student answer: In quick sort, elements are picked one by one and then shifting it to its correct position by counting elements smaller than it in the given array and then placing it.
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 choosing a pivot element randomly and comparing all elements to it  and swapping when it encounters a larger element . it then stores it as partition variable and divides the array into two parts with indexes from 0 to p and p+1 to n and performs the above mentioned step till it reaches division of array length of  0. 
Score: 2.0

Student answer: it is sorting technique that involves sorting the array be analyzing the values and then sorting according to them.
Score: 1.0

Student answer: In Insertion sort, the next smallest element is inserted in the array at it's appropriate place.\nIn Selection Sort, the smallest element in the array is found and selected to place it appropriately.\n
Score: 0.0

Student answer: A quick sort separates the array into two parts and then compare the pivot element with each element if the sub array, if it is again not found , then it again divides the sub array into half ..it does it until the array is sorted in the order. The pivot element is the smallest  element of the array.
Score: 1.0

Student answer: Quick sort works by maintaining a pivot element. We start two loops maintaining two pointers i and j, i starts from 0th index while j starts from end and traverse towards the start. If the ith element is less than the pivot element the pivot and element are swapped and if pivot is greater than jth element and pivot and jth element are swapped, when i crosses j the pivot is shifted to that point and the loop starts again and goes on till all the elements are sorted.
Score: 2.0

Student answer: Quicksort is a sorting technique that have a complexity of (nlogn ) and is widely used in carrying out sorting.\nit calculates a pivot element and and then traverse the array which has to be sorted and check whether each element in array is smaller than or greater than pivot element and \narrange them according untill very end.\nPivot Element can be calculated as a first element or as a last element or as middle element.
Score: 2.5

Student answer: In the sorting technique the pivot element is compared with the other elements and then the positions of the element is changed accordingly.\nThis sorting technique uses a time complexity of O(n log n).
Score: 1.0

Student answer: In the sorting technique the pivot is compared to the other elements and changed accordingly.\nTime Complexity= O(n log n).
Score: 1.0

Student answer: In quick sort, we select a pilot element and then compare it with other elements swap accordingly.
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 is a type of sorting technique. It works on the algorithm of divide and conquer. It takes a pivot element and two other pointers up and down. It then compares the pivot elements with up and down pointers element respectively and swaps the elements based n few conditions. \nIf pivot<=down move to next \nElse swap (pivot,arr[down])\nIf pivot >up then move to next\nElse swap (pivot,arr[up])\nIf up or down crosses each other 
Score: 2.5

Student answer: In quick sort  algorithm we take an element from array which is called pivot and place it on the position such that all elements on the left hand side of pivot element are smaller that pivot element and on right hand side all elements are greater than pivot element. This is done recursively to sort array.
Score: 2.5

Student answer: QuickSort is a divide-and-conquer algorithm that selects a pivot element and partitions the array such that all elements smaller than the pivot are moved to its left and all larger elements to its right. This process is repeated recursively on each partition until the entire array is sorted.
Score: 2.5

Student answer: quick sort works through the method of divide and conquer, it involves an array being split and selection of a pivot point and swapping of the elements based on the pivot point.
Score: 2.0

Student answer: In quick sort, a pivot element is selected which can be fixed in front , back or middle of the list and then the list is divided in parts based on this pivot element and certain conditions . we sort the individual parts and then combine them finally 
Score: 1.0

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

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

Student answer: 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 till the whole array is sorted. \nAlgorithm used - Divide and Conquer
Score: 2.5

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

Student answer: Quick sort uses a key value and then compare with other elements present in the array.
Score: 1.0