Unnamed: 0 int64 1 5.86k | Question stringclasses 24
values | Sample ANS stringclasses 24
values | Student ANS stringlengths 1 1.06k | Score float64 0 2.5 |
|---|---|---|---|---|
2,872 | How insertion sort and selection sorts are different? | 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... | 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. | 1 |
2,873 | How insertion sort and selection sorts are different? | 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... | 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... | 1 |
2,874 | How insertion sort and selection sorts are different? | 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... | 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. | 1 |
2,875 | How insertion sort and selection sorts are different? | 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... | 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 | 1 |
2,876 | How insertion sort and selection sorts are different? | 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... | In insertion sort,an array is traversed | 1 |
2,877 | How insertion sort and selection sorts are different? | 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... | 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 | 1 |
2,879 | How insertion sort and selection sorts are different? | 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... | 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. | 1 |
2,881 | How insertion sort and selection sorts are different? | 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... | << i << \ | 0 |
2,882 | How insertion sort and selection sorts are different? | 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... | 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. | 1 |
2,883 | How insertion sort and selection sorts are different? | 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... | 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 plac... | 1 |
2,884 | How insertion sort and selection sorts are different? | 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... | 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 ... | 2.5 |
2,885 | How insertion sort and selection sorts are different? | 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... | 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 s... | 1 |
2,887 | How insertion sort and selection sorts are different? | 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... | 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 ind... | 1 |
2,888 | How insertion sort and selection sorts are different? | 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... | 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. | 2.5 |
2,889 | How insertion sort and selection sorts are different? | 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... | 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. | 0 |
2,890 | How insertion sort and selection sorts are different? | 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... | 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 | 1.5 |
2,891 | How insertion sort and selection sorts are different? | 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... | 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. | 1 |
2,892 | How insertion sort and selection sorts are different? | 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... | Insertion sort divides and insert the given value while selection sort selects the value which is required | 2.5 |
2,893 | How insertion sort and selection sorts are different? | 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... | 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) | 0 |
2,894 | How insertion sort and selection sorts are different? | 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... | Insertion sort compares one element to every other elemt and swaps if value is greater or smaller. | 0 |
2,895 | How insertion sort and selection sorts are different? | 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... | 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... | 1 |
2,897 | How insertion sort and selection sorts are different? | 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... | 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. | 2.5 |
2,899 | How insertion sort and selection sorts are different? | 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... | 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 | 1.5 |
2,901 | How insertion sort and selection sorts are different? | 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... | 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. | 1 |
2,902 | How insertion sort and selection sorts are different? | 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... | 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 | 1 |
2,904 | How insertion sort and selection sorts are different? | 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... | 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 | 1 |
2,905 | How insertion sort and selection sorts are different? | 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... | 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 bigge... | 2.5 |
2,906 | How insertion sort and selection sorts are different? | 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... | 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. | 0 |
2,907 | How insertion sort and selection sorts are different? | 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... | 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 | 0 |
2,908 | How insertion sort and selection sorts are different? | 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... | in | 0 |
2,909 | How insertion sort and selection sorts are different? | 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... | 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. | 2.5 |
2,912 | How insertion sort and selection sorts are different? | 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... | insertion sort just compare the values and insert the values and selection sort is similar as quick sort | 2 |
2,913 | How insertion sort and selection sorts are different? | 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... | insertion sort is used when the array is completely sorted where as selection sort is used when the array is partially sorted | 0 |
2,915 | How insertion sort and selection sorts are different? | 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... | 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. | 0 |
2,916 | How insertion sort and selection sorts are different? | 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... | in insertion sort element is being inserted at the end and in selection sort element inserted at random. | 0 |
2,917 | How insertion sort and selection sorts are different? | 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... | 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 | 0 |
2,918 | How insertion sort and selection sorts are different? | 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... | 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 | 2.5 |
2,919 | How insertion sort and selection sorts are different? | 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... | 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. | 2 |
2,920 | How insertion sort and selection sorts are different? | 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... | in insertion sort we assign pre value to max and min and then change them accordingly after comparison\nselection sort have more time complexity | 0 |
2,921 | How insertion sort and selection sorts are different? | 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... | 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 | 2 |
2,922 | How insertion sort and selection sorts are different? | 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... | 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 | 0 |
2,923 | How insertion sort and selection sorts are different? | 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... | insertion short and select short are different because we give in put to both of them by the different method | 0 |
2,924 | How insertion sort and selection sorts are different? | 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... | 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 | 0 |
2,925 | How insertion sort and selection sorts are different? | 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... | insertion sort break the array then assemble in sort and in selection sort in we select in element and compare and sort them | 0 |
2,926 | How insertion sort and selection sorts are different? | 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... | in insertion sort we can insert the value & when the array is partially not defined in selection sort. | 0 |
2,927 | How insertion sort and selection sorts are different? | 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... | the number of comparisions in selection sort is less than insertion sort | 0 |
2,928 | How insertion sort and selection sorts are different? | 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... | 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. | 0 |
2,929 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | quick sort uses a partition 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. | 2.5 |
2,930 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | in quick sort 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 sw... | 2 |
2,931 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | 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 ... | 2 |
2,932 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick sort is a divide and conquer element, it takes a random pivot element and compares it with other elements and then swaps there positions | 2 |
2,933 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick sort is a divide and conquer algorithm. It 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. | 2 |
2,934 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick sort is 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 ... | 2.5 |
2,935 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | a 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. | 2.5 |
2,936 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quicksort\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. | 2 |
2,937 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | -> Quicksort 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 | 2 |
2,938 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | quick sort is a Divide and Conquer algorithm. It picks an element as a pivot and partitions the given array around the picked pivot | 1 |
2,939 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | It works on divide and 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 so... | 2.5 |
2,940 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick sort 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 . | 2.5 |
2,941 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick sort works on divide and conquer method , 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. | 2 |
2,942 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick Sort is 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 g... | 2.5 |
2,943 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | quick sort works on the basis of divide and conquer methodology. | 1 |
2,944 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | We 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... | 2.5 |
2,945 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick sort works by creating 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 | 2.5 |
2,946 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | The 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. | 0 |
2,947 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | quick sort 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 ... | 2 |
2,948 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick Sort is a 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 respective... | 1 |
2,949 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | In quick sort we select 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... | 2.5 |
2,950 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | In quick sort we select 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. | 1 |
2,952 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | 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 ... | 0 |
2,953 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | quick sort 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 complexi... | 2.5 |
2,954 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | We take a pivot 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... | 2.5 |
2,955 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | A pivot 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 ... | 2.5 |
2,956 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | We take a pivot 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 co... | 2.5 |
2,958 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | In quick sort, 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. | 2 |
2,959 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | quick sort 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. | 1 |
2,960 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | The 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 ) | 2 |
2,961 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | quick sort works on the divide and conquer approach 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. | 2 |
2,962 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | 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 | 2 |
2,963 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick Sort works using 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. | 2 |
2,964 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick sort algorithm uses divide and conquer algorithm to sort any given array. | 1 |
2,965 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | a 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. | 2 |
2,966 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | First we 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 a... | 2 |
2,967 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | 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. | 0 |
2,968 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | quick sort uses a pivot 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. | 2.5 |
2,969 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | In quick sort, 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. | 1 |
2,970 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | quick sort works by 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 ... | 2 |
2,971 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | it is sorting technique that involves sorting the array be analyzing the values and then sorting according to them. | 1 |
2,972 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | In Insertion sort, the 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 | 0 |
2,973 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | A 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. | 1 |
2,974 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick sort works by 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... | 2 |
2,975 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quicksort is a 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 ... | 2.5 |
2,976 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | In the 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). | 1 |
2,977 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | In the sorting technique the pivot is compared to the other elements and changed accordingly.\nTime Complexity= O(n log n). | 1 |
2,978 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | In quick sort, we select a pilot element and then compare it with other elements swap accordingly. | 1 |
2,979 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick sort is a 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 ... | 2.5 |
2,980 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | In quick sort 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. | 2.5 |
2,981 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | QuickSort is a 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. | 2.5 |
2,982 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | quick sort works 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. | 2 |
2,983 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | In quick sort, a pivot element is 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 | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.