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 |
|---|---|---|---|---|
3,089 | 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 sorting technique which sort the array by comparing the least element with every element. | 2 |
3,090 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick sort works on the principle of divide and conquer and has Time Complexity of O(nlogn). it works by having three pointers. one will point at pivot. the other at beginning and the other at end of array. Pivot can be beginning, end or middle (any) element. i moves from right to left. j moves left to right. when the ... | 2 |
3,091 | 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 sorts follows divide and conquer algorithm. We take a pivot element and the elements smaller than the pivot element are brought to the left of it and the greater are brought to the right of it. and as soon as the pointer for bigger element surpasses the smaller one , the element pointed by the small element poin... | 2 |
3,092 | 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 divide and conquer approach it picks a random element and then divide the array around it. | 2 |
3,093 | 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 use two pointers one for left and other for right left pointer traverse from left to right and right traverse form right to left.\nWe select one pivot element and if [key+left]/2<mid then pointer then left pointer move towards right and if [key+left]/2>mid then second pointer moves from right to left. | 2 |
3,094 | 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. It picks an element as a pivot and partitions the given array around the picked pivot. There are many different versions of quickSort that pick pivot in different ways | 2 |
3,095 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | It works by dividing an array into smaller arrays and changing he smaller arrays , depending on the pivot that is taking element from both the arrays are either incremented or swapped accordingly with smaller element present in the first array. | 2 |
3,097 | 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 work divider and conquer algorithm\nit is a sorting technique to sort the data accordingly | 2 |
3,098 | 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 use to take a pivot to sort the whole array. we use to take a pivot and compare it with the next element if the elment is small than we use to change the position of the element with the next one. | 2 |
3,099 | 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 breaks an array into smaller arrays and then swaps the smaller ones, by comparing with the adjacent element. | 2 |
3,101 | 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 with the help of a divide and conquer algorithm. Here we take the help of a recursion.\nHere first we find a partition element then we place it at its correct position then we sort the elements present before the partition elements and the elements after that partition element with the help of recursio... | 2 |
3,102 | 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. | you select a element as the pivot and put all the elements in their correct places with respect to the pivot that and do it recursively until the array becomes sortes | 1 |
3,103 | 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 choose a pivot element and place all the smaller elements to the left of it and all the larger elements to the right of it. Then using divide and conquer we break the array from that element in two parts and solve both arrays using recursion using same method. | 2 |
3,104 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick sort works by taking one element at a time(pivot) and then placing it in its correct postition then calling the function recursively for this elements left and right side | 1 |
3,105 | 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 the method of divide and conquer . An index called pivot is first taken then the array is divided into 3 parts . 1st where the elements are smaller than the one at pivot ,2nd where the elements are equal to the one at pivot and 3rd where the elements are greater . now at each step the quick sort is ... | 2 |
3,106 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | divide and conquer | 1 |
3,107 | 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. | so in a quick sort first of all we take up any element as pivot element .\nthen we form a partition where all elements smaller than pivot element is put to the left of it and all elements greater are put to the right of it.\nthen we start comparing and placing every element to its correct position .\nit works in O(nLOG... | 1 |
3,108 | 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 in which we first select a random element in the array which we call as pivot element and then we put all elements which are smaller than pivot in its left and bigger in right this places our pivot element at its correct position. Then we se;ect another pivot in left and right side so ... | 1 |
3,109 | 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 function of quick sort is to sort the given array in O(n*logn) time complexity. \nIt uses the divide and conquer approach to solve the problem. An element is taken from the given array and then compared with all the elements by finding the largest element in each traversal and then placing that largest element in t... | 2 |
3,110 | 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 follows divide and conquer algorithm. in which we select a pivot element and arrange the element lesser than it in left and greater than it in right to sort thr element. | 2 |
3,111 | 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 algorithm picks a pivot element and rearranges the array elements so that all elements smaller than the picked pivot element move to the left side of the pivot, and all greater elements move to the right side. Finally, the algorithm recursively sorts the subarrays on the left and right of the pivot element. | 1 |
3,112 | 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 pick an element in random and check the number of elements smaller and larger than it \nthan we put the chosen element in its position in the array (if it were sorted)\nthan all the elements that are larger than it are put to its left side and the larger elements on the right side\nand we call the func... | 1 |
3,113 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick sort works on partition theorem (Lomuto,Hoare partition theorems)\nin quick sort array is partioned about an any element (mainly first and last) and then recursive call done for two arrays while is the part of main array that is divided due to the pivot element and we repeat process untill 1 element left after th... | 1 |
3,114 | 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. | element is put in on its position and on left small elememts are kept and on right greater elements than the elements are put and for other elements recursion is called | 1 |
3,115 | 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 a simple method of searching whether an element exists in any particular data structure, It takes the required element and compares it with each of the element present in the data structure. If found. it gives us the required result . | 1 |
3,116 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | It works by breaking an array into smaller ones and swapping the smaller ones depending upon comparison with pivot element | 1 |
3,117 | 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 get a random data from amongst the array of data available. Then we compare the value of this data with the other datas. Then we divide the array into two factions, then repeat the above procedure until we are left with NULL. Then we combine the elements in the order that they were divided and we have the sorted ar... | 1 |
3,118 | 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 technique we first choose an element from our array as a pivot element. Then placed the elements such that the elements which are smaller than the pivot element should placed on the left of it and elements which are greater should be on the right of it. | 1 |
3,119 | 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 sorting technique which basically works on divide and conquer approach it find pivot element and arrange element on left and right according to the pivot.Then pivot element for two partitioned arrays are generated till the array is sorted. | 2 |
3,120 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick sort works on the principle of divide and conquer.It first divides the problem into smaller smaller problems,solves those and then combines those smaller problems that is it divides the array to be sorted in smaller arrays and then combines those smaller sorted arrays to get the sorted array as the solution. | 2 |
3,121 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | In this we take a pivot element randomly and we place all the elements in either left or right of the pivot and hence we find the sorted array. | 2 |
3,123 | 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 technique its working is as follows:-\n1-in quick sort we randomly select a pivot element from the data\n2-we find all the elements less than and greater than pivot\n3-then we place the pivot at its correct position\n4-then we call recursion | 2 |
3,124 | 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 randomly from the set of elements and all the other elements are placed either to the right or left to this pivot element | 2 |
3,125 | 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. | <<endl;\n }\n}\n\n | 0 |
3,126 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | quick sort works on the principle of divide and conquer . in quick sort we find the pivot element and it is placed at its correct position when we call it recursively | 1 |
3,127 | 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 finding an element known as pivot whose correct position in the array/vectors is obtained and is placed according to it's correct position. Now the elements less than this pivot element are placed before it and greater/equal elements are placed after it. This repeats for the smallest size array to... | 1 |
3,128 | 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. | follows divide and conquer approach, in which we break down the array into single element then perform some operation on these elements, and at the end we have our data sorted. | 2.5 |
3,130 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | quick sort work by finding the position of piviot element and sorting accordingly and doing this in reccursive manner. | 2.5 |
3,131 | 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 array first we take the middle term as pivot or the last term as pivot .then here two array will be created that the parting of the array and compare the arrays rem one by one with the pivot and give in final array and that array will be sorted in the partition of an array is the approach | 2.5 |
3,132 | 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 each iteration, an element is picked and it is swapped till it reaches its correct position in the array, that is, greater elements are on the right and lesser elements go to the left. | 2 |
3,133 | 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 run a iterator and compares the every element starting from the index 0, whenever the value of right index surpasses the value of its imediate left index we swap them. We perform this process again and again until we get a sorted array. | 1 |
3,134 | 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 correct position of a pivot element from unsorted array in the sorted array and place it at that position and in this way it finds the correct position of each element and hence, sorts the array | 2.5 |
3,135 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | Quick sort works by selecting an element as pivot and sorting array around the value of the pivot such that the value greater than the value of pivot come after index of pivot . Then updating the pivot and again following the same procedure till the array gets sorted. | 2.5 |
3,136 | 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. | there are different of sorting like Merge sort,quick sort etc.\nsorting is basically the way to sort given array in different ways like in merge sort we divide the array in two equal parts till it reaches upto single values \nsimilarly quick sort works in a way that we have to compare first element to every other eleme... | 2 |
3,137 | 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 divide the array in two parts than sort both parts in a order | 2.5 |
3,139 | 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 first partioning the array about a pivot element(random element from the array) so that the pivot element comes to its correct position where it should be in a sorted array. And a recursive function should be runned from low index to pivot index and pivot+1th index to high index in a recursivfe mann... | 2.5 |
3,140 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | in this we select a pivot element and then acc to this pivot element we divde the array and sort it in 2 parts and then doing this recursively | 2.5 |
3,141 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | it works on the concept of divide and conquer it first sets the pivot element and the one by divide elements into subarrays by using pivot and then compare elements on the most basic level | 2.5 |
3,143 | 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 function utilizes the use of partition function which actually selects a random element from the array and place it according to logographical order then elements smaller than it are placed on the left and vice versa with the larger elements, partition index is returned for which the quick sort is called two... | 2.5 |
3,144 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | in this we select the priort element and acc to this priot element we divide the list in 2 parts | 2.5 |
3,145 | 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 first partitions the array about the pivot element. It then puts all the elements less than the pivot element before it and all elements greater than pivot element after it in the array.This runs recursively until entire array is sorted. | 2.5 |
3,146 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | in quick sort a pivot is selected \nthe i+1 th elements is compared with ith item\nif i+1<i then we swap\nwhere i =selected pivot | 2.5 |
3,147 | 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. | sorting is used to do simply things, quick sort quickly sort all the functions, entities in the program | 0 |
3,148 | 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. | selecting the middle element of an array as pivot \nkeeping the smallest to pivot the left and larger on the right \nsorting both arrays separately and at last place the pivot on it's position | 2.5 |
3,149 | 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 first partions the array in two different part and then it sorts the elements in such a way that the element to the left of pivot (partition point) is smaller and to the right is is biggger. | 2.5 |
3,151 | 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 their is three things are given one is first sub array and middle pivot element and second sub array. and we move in two loops to check the value that the element is lesser or greater than pivot element. | 2.5 |
3,152 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | quick sort work in time of (log n) it works on the concept of divide and conquer method to achieve a particular result in the given array \nso firstly it divide the hole array into a single element and the sort it on the bases of ascending order and then give a desire result | 2.5 |
3,153 | 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 randomly selects a pivot element and divides the structure according to it. The elements that are smaller than that goes to the left and the elements bigger goes to the right. It then keep dividing them further in the same manner till single elements remain and then starts merging them to form the final sort... | 2.5 |
3,154 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | in quick sort first we take a pivot element and then compare it element starting from right and left \nif the left one element is smaller then we replace it with greater and if right one element is smaller then we shift the pivot element to it | 2.5 |
3,156 | 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 first sort the given array the find the pivot from the given element and the compare it from all elements and by this process we find and sorted and optimal array. | 2.5 |
3,157 | 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 a pivot element is to be chosen then, elemnts get indexed or traversed as per its order means element grater or less than the pivot element | 2.5 |
3,158 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | In Quick sort. \n1. We define a pivot element and start comparison from right to left.\n2. If left element is smaller than we replace it with the greater element \n3. If the right element is smaller than we shift the pivot element to it. | 2.5 |
3,159 | 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 we compare the element from starting index 0 and compare the element such that we swap the two elements if they arent in order then we compare the next element in the array then we again compare the previous ad the first element and so on. | 0 |
3,160 | 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 two pointers are taken and one pivot point is taken we put conditions for elements if the right pointer satisfy the condition then it shift toward left, if pivot is being crossed then both values are swapped. | 1 |
3,161 | 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 divides the given array in two parts in which the point from where we divided , the left side is occupied by the elements which are smaller than the pivot and the right side is occupied by the elements greater than the pivot (pivot - middle element of the array). after all the sorting process we get an array... | 2.5 |
3,162 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | In quick sort , we first select a pivot element. Then we use recursion to keep the elements lower than the pivot element to the left of the pivot and the element greater than the pivot element to the right of the element and do this until the array is sorted | 2.5 |
3,163 | 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 works on the array by traversing array from both the ends start to end or end to start and arrange it in increasing or decreasing sequence | 1 |
3,164 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | in this an element is made pivot and then we compare pivot to all the elements in an array and when pivot comes in middle we divide the array into two in which left side of pivot is smaller than pivoted element and right side is greater than pivot and again follows same process. | 2.5 |
3,166 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | in quick sort, first the a pivot is declared in the middle of the array then two pointers one at the beginning and one at the last respectively. The pointer at the start of the array moves forward and checks weather the value of pivot is greater or less than it. If the value is more, they digits are swapped, if it is l... | 2.5 |
3,167 | 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 short short a date and bring a desirable output to the audience | 0 |
3,168 | 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 takes a pivot point and breaks the left array into sub arrays taking centre as pivot, and it continues till we reach to individual items and the we rejoi the values by compaing them. | 2 |
3,169 | 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 having i and j i move to end of array and j move to starting of array I is find bigger element and j finding smaller element swap them again doing same thing | 1 |
3,170 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | pivot elements. | 0.5 |
3,171 | How quick sort works? | Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort. | in this sorting algorithim the partition is create in an unsorted array in which the first part is sorted and corresponding the second part is sorted | 0 |
3,172 | 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 working is similar as selection sort, | 0 |
3,173 | What is tree traversal? | Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal | The process of travelling/visiting every node of a tree is referred to as tree traversal. | 1 |
3,174 | What is tree traversal? | Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal | there are 3 tree traversals which are preorder, postorder, inorder . tree traversals are generally an idea to visit every node of a tree in division of three which are either root->left subtree->right subtree, left subtree->right subtree->root, left subtree->root->right subtree respectively | 2.5 |
3,175 | What is tree traversal? | Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal | In tree traversal all the elements which are present in the tree are exactly visited once tree traversal can be done in many different ways like BFS which is breadth first search and dfs which is depth first search | 2 |
3,176 | What is tree traversal? | Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal | Tree traversal refers to traversing the tree data structure starting from root node than moving to every child of the tree | 2 |
3,177 | What is tree traversal? | Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal | Tree traversal refers to the accessing the elements inside the tree. It can be done in 3 ways, preorder traversal, inorder traversal, postorder traversal. \nPreorder traversal starts accepts the root node as input, traverses root first then the left child and at last the right child.\nInorder traversal traverses left c... | 2.5 |
3,178 | What is tree traversal? | Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal | Tree traversal is used to traverse every node of tree data structure. \nTraversing every node from root to leaf | 2 |
3,179 | What is tree traversal? | Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal | tree traversal is a method in which left sub tree is visited first then root is visited and at last the left sub tree. | 1 |
3,180 | What is tree traversal? | Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal | Tree traversal is of 3 types postorder, inorder and preorder. Through tree traversal we write all the elements of the tree . Like in postorder traversal first it takes the left node then it takes the right node then it takes the root node. | 2.5 |
3,181 | What is tree traversal? | Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal | Tree traversal is visiting each and every node in a tree\nthere are three types of tree traversal \npostorder (first left then right then node)\ninorder (first left then node then right)\npreorder (node left then left then right) | 2.5 |
3,182 | What is tree traversal? | Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal | tree traversal is a process to visit all the nodes of a tree to carry out a particular function and may print their values too. | 1 |
3,183 | What is tree traversal? | Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal | Tree traversal is the traversing or visiting the each node of the tree . | 1 |
3,184 | What is tree traversal? | Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal | Checking or observing any node of a tree in order to obtain the solution of your search is called tree traversal. | 1 |
3,185 | What is tree traversal? | Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal | Tree traversal means traversing tree in DFS or BFS form and going through each node and storing it's data and then retrieving it. | 1 |
3,186 | What is tree traversal? | Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal | There are three types of traversing/ looking through/ reading the values stored in a tree, which include inorder preorder and postorder treversal. \nInorder: left child-> root -> right child\nPreorder: root -> left child-> right child\nPostorder: right child-> left child -> root | 2.5 |
3,187 | What is tree traversal? | Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal | moving on each node of the tree is called tree traversal.\n | 1 |
3,188 | What is tree traversal? | Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal | Exploring/visiting each and every node of the tree is know as tree traversal. | 2 |
3,189 | What is tree traversal? | Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal | Tree is a data structure and there are three tree traversal techniques that help us read data from all the nodes without leaving any node\n1. Breadth First Search : In this, start from root node and store all the children of root node in a queue and then take an element from queue, explore that node and keep repeating ... | 2 |
3,190 | What is tree traversal? | Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal | In quick sort, there exist a pivot which plays a major role in sorting the array quickly.\nIt sorts the array in such a way that the value before pivot are smaller than it and the values ahead of the pivot are greater than it.\nIt is hence to be checked again and again until pivot reaches to the last. | 0 |
3,191 | What is tree traversal? | Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal | tree traversal is the technique in which we traverse each node from root to leaf of the tree effectively ,it can be post, order ,pre order, inorder traversal | 2.5 |
3,192 | What is tree traversal? | Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal | Tree traversal is traversing a list of elements in a tree using different approaches. | 1.5 |
3,193 | What is tree traversal? | Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal | Tree traversal is a pattern for traversal in a tree which covers every node of a tree in a particular set pattern .\nExample- Preorder traversal => root->left->right (It utilizes this pattern to print all the nodes of a tree)\n In order Traversal => left->root->right\n Post order traversal... | 2.5 |
3,194 | What is tree traversal? | Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal | Tree traversal is meant by visiting every node that comprises of a tree, and it could be in any order. \nexample: preorder(root->left->right)\n inorder (left->root->right)or\n postorder (left->right->root) | 2.5 |
3,195 | What is tree traversal? | Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal | Tree traversal is a method of exploring the every nodes of tree from its root to its children node. The time taken to traverse the tree is O(logn)\nMethods of tree traversal are:\nlevel order traversal \npost order traversal \npre order traversal\ninorder traversal \n | 2.5 |
3,196 | What is tree traversal? | Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal | Quicksort is one of the most efficient sorting algorithms. This is because it has time complexity of O( nlogn ). In quicksort, a partition element is choosen, which divides array into two subarrays and the array is sorted accordingly. For example, if A={7,3,9,5,8,12} is an array with partition element 5, all elements l... | 0 |
3,197 | What is tree traversal? | Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal | tree traversal is where we go through each and every node and print there data through our print function,\nexample :level order traversal ,preorder , Postorder , Inorder . | 2.5 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.