id stringlengths 11 11 | question stringclasses 79
values | instructor_answer stringclasses 80
values | student_answer stringlengths 1 959 | score_grader_1 float32 0 10 | score_grader_2 float32 0 10 | score_avg float32 0 5 |
|---|---|---|---|---|---|---|
E11.Q10.A09 | Briefly describe in one sentence how does merge sort work? | It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays. | Break a single array down into many arrays with individual elements, then sort the elements as you reconstruct them back into a single array. | 10 | 10 | 5 |
E11.Q10.A10 | Briefly describe in one sentence how does merge sort work? | It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays. | Merge sort breaks the array in half, and continues to do so until it has 2 elements to compare and sorts them, after doing so it "merges" back as it keeps on sorting the algorithm as it does so. | 10 | 10 | 5 |
E11.Q10.A11 | Briefly describe in one sentence how does merge sort work? | It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays. | Merge sort divides the problem in half, organizes each half, then brings the two halves together again. | 10 | 10 | 5 |
E11.Q10.A12 | Briefly describe in one sentence how does merge sort work? | It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays. | Take an array and split it into two, then solve these simpler problems and merge the two answers in correct order. | 10 | 10 | 5 |
E11.Q10.A13 | Briefly describe in one sentence how does merge sort work? | It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays. | A merge sort recursively divides the array into half until only one element remains, then it sorts the data on its way out of the recursive call by merging the cells. | 10 | 10 | 5 |
E11.Q10.A14 | Briefly describe in one sentence how does merge sort work? | It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays. | Merge sort recursively divides an array into two arrays until all arrays have 1 element, at which point it merges the 1 element arrays into larger sorted arrays, the final returned array being the sorted version of the initial array. | 10 | 10 | 5 |
E11.Q10.A15 | Briefly describe in one sentence how does merge sort work? | It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays. | Merge sort continuously breaks an array in half then sorts the arrays as it concatenates them back together into one sorted array. | 10 | 10 | 5 |
E11.Q10.A16 | Briefly describe in one sentence how does merge sort work? | It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays. | It takes an array, splits itself in half, sorts the two halves (either by recursion or iteration) and compares them together giving a third array a full sorted list with both halves rejoined. | 10 | 10 | 5 |
E11.Q10.A17 | Briefly describe in one sentence how does merge sort work? | It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays. | it splits a large array into small arrays and recurs until the array is a size of 1, and then merges all of the arrays back together until the source array is completely sourted. | 10 | 10 | 5 |
E11.Q10.A18 | Briefly describe in one sentence how does merge sort work? | It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays. | Mergesort divides the array into smaller halves and then combines the sorted subarrays into one sorted array. | 10 | 10 | 5 |
E11.Q10.A19 | Briefly describe in one sentence how does merge sort work? | It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays. | merge sort breaks the array down in halves until it is comparing two values, sorts those two values, then merges that back with the other broken down parts that it sorted, each level merging more sets together till you return back to your whole array in order. | 10 | 10 | 5 |
E11.Q10.A20 | Briefly describe in one sentence how does merge sort work? | It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays. | Divides the data into twor separate arrays, sorts the two arrays and merges them back to back together recursively. | 10 | 10 | 5 |
E11.Q10.A21 | Briefly describe in one sentence how does merge sort work? | It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays. | Take the initial array and split it into two, temporary, smaller arrays, sort the two smaller arrays, and merge them back into a single array. | 10 | 10 | 5 |
E11.Q10.A22 | Briefly describe in one sentence how does merge sort work? | It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays. | merge sort divides the data into halves until data of one element is reached and then merges each element together according to its placement in comparison to the rest of the data | 10 | 10 | 5 |
E11.Q10.A23 | Briefly describe in one sentence how does merge sort work? | It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays. | merge sort uses the divide and conquer strategy, sorting an array in parts, then merging the sorted parts back together. | 10 | 10 | 5 |
E11.Q10.A24 | Briefly describe in one sentence how does merge sort work? | It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays. | Divide recursuivly big array into two arrays, sort two array and merge them togather recuruivly. | 10 | 10 | 5 |
E11.Q10.A25 | Briefly describe in one sentence how does merge sort work? | It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays. | divides an array in half and sorts each half by calling its self, thus dividing each half again and again and sorting it until the array is sorted. then putting the elements back in the original array sorted. | 10 | 10 | 5 |
E11.Q10.A26 | Briefly describe in one sentence how does merge sort work? | It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays. | Merge sort takes an array and splits it in half and sends each half back to itself recursively and merges and sorts the two halves when it starts going back up. | 10 | 10 | 5 |
E11.Q10.A27 | Briefly describe in one sentence how does merge sort work? | It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays. | merge sort splits an array into two halves and then sorts the two smaller arrays, and then merges them back together to form a sorted array | 10 | 10 | 5 |
E11.Q10.A28 | Briefly describe in one sentence how does merge sort work? | It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays. | the merge sort continually divides the array (or set of containers) into halves, until it reaches the point where there is just one element left, then merges each of the sets of two sorted arrays (containers). | 10 | 10 | 5 |
E11.Q10.A29 | Briefly describe in one sentence how does merge sort work? | It splits the original array into two, sorts each of the two halves, and then merges the sorted arrays. | merge sort splits an array of elements into smaller and smaller array's till the value of 1 is reached. | 10 | 5 | 4 |
E12.Q01.A00 | What is a pointer? | The address of a location in memory. | A variable in memory that hold the address of another memory location to which it points too | 10 | 10 | 5 |
E12.Q01.A01 | What is a pointer? | The address of a location in memory. | A pointer is a variable that contains the memory address of a given value. | 10 | 9 | 5 |
E12.Q01.A02 | What is a pointer? | The address of a location in memory. | A pointer is a variable that stores the address of another variable. | 10 | 10 | 5 |
E12.Q01.A03 | What is a pointer? | The address of a location in memory. | A pointer is a variable that holds a memory address or location of another variable. | 10 | 10 | 5 |
E12.Q01.A04 | What is a pointer? | The address of a location in memory. | A data type that points to an address in memory which contains certain information. Used for pass-by-reference to save memory. | 10 | 10 | 5 |
E12.Q01.A05 | What is a pointer? | The address of a location in memory. | a pointer points to a location in memory of a certain data type | 10 | 9 | 5 |
E12.Q01.A06 | What is a pointer? | The address of a location in memory. | A pointer is a variable that points to the address location of another variable. Represented by (*). | 10 | 10 | 5 |
E12.Q01.A07 | What is a pointer? | The address of a location in memory. | A pointer is a variable that holds the address of a given variable (and of a given data type) | 10 | 10 | 5 |
E12.Q01.A08 | What is a pointer? | The address of a location in memory. | pointer is a programming data type whose value points to another value stored in computer memory by its address. | 10 | 10 | 5 |
E12.Q01.A09 | What is a pointer? | The address of a location in memory. | A data type that points to a specific memory address. | 10 | 10 | 5 |
E12.Q01.A10 | What is a pointer? | The address of a location in memory. | Its like a variable except it only holds the address in memory of the variable not the physical information. | 10 | 10 | 5 |
E12.Q01.A11 | What is a pointer? | The address of a location in memory. | a pointer is a reference to a memory location. | 10 | 10 | 5 |
E12.Q01.A12 | What is a pointer? | The address of a location in memory. | A pointer is an alias to an object in memory. | 8.5 | 7 | 4 |
E12.Q01.A13 | What is a pointer? | The address of a location in memory. | A pointer is a variable that contains a memory address for something that you can use, such as a value, array, or even a function. | 10 | 10 | 5 |
E12.Q01.A14 | What is a pointer? | The address of a location in memory. | its a data type with a memory address and a value | 10 | 3 | 3.5 |
E12.Q01.A15 | What is a pointer? | The address of a location in memory. | a form of storing data that keeps the location in memory of an data type or object. | 10 | 10 | 5 |
E12.Q01.A16 | What is a pointer? | The address of a location in memory. | it contains a object's memory address | 10 | 10 | 5 |
E12.Q01.A17 | What is a pointer? | The address of a location in memory. | variable that contains the memory address of a data object. | 10 | 10 | 5 |
E12.Q01.A18 | What is a pointer? | The address of a location in memory. | A pointer is an element that references a memory location. | 10 | 10 | 5 |
E12.Q01.A19 | What is a pointer? | The address of a location in memory. | an object that points to a specific place in memory, where a variable or value is stored. | 10 | 10 | 5 |
E12.Q01.A20 | What is a pointer? | The address of a location in memory. | a variable that stores the address of a memory location | 10 | 10 | 5 |
E12.Q01.A21 | What is a pointer? | The address of a location in memory. | A pointer is a variable that points to an address in memory, which contains some data. The pointer does not contain or point to any data, only a memory address. | 10 | 10 | 5 |
E12.Q01.A22 | What is a pointer? | The address of a location in memory. | Pointer is a variable which have a memory address of a variable. | 10 | 10 | 5 |
E12.Q01.A23 | What is a pointer? | The address of a location in memory. | a pointer points to a location in memory where data is stored | 10 | 10 | 5 |
E12.Q01.A24 | What is a pointer? | The address of a location in memory. | a variable that holds the address of another variable and can access the contents of the variable. | 10 | 10 | 5 |
E12.Q01.A25 | What is a pointer? | The address of a location in memory. | a pointer is a memory address that points to a data member | 10 | 10 | 5 |
E12.Q01.A26 | What is a pointer? | The address of a location in memory. | A data type that stores the memory address of another variable. | 10 | 10 | 5 |
E12.Q01.A27 | What is a pointer? | The address of a location in memory. | its like a variable but only holds an address in meomrry not the physical address. | 10 | 2 | 3 |
E12.Q02.A00 | What is the experimental approach for measuring the running time of an algorithm? | Implement the algorithm and measure the physical running time. | Try several sets of data on an algorithm that includes worst case, best case, and random cases. Also try and run the same program on a different computer with the same specs | 7.5 | 10 | 4.5 |
E12.Q02.A01 | What is the experimental approach for measuring the running time of an algorithm? | Implement the algorithm and measure the physical running time. | not answered | 0 | 0 | 0 |
E12.Q02.A02 | What is the experimental approach for measuring the running time of an algorithm? | Implement the algorithm and measure the physical running time. | time complexity using big O <br>logarthmic O(log n)<br>linear O(n)<br>exponential O(n^2)<br>quadratic O(n^k) k>=1<br>Polynomial O(a^n) n>1<br> | 6 | 3 | 2.5 |
E12.Q02.A03 | What is the experimental approach for measuring the running time of an algorithm? | Implement the algorithm and measure the physical running time. | Using some sort of counting principle of the number of operations performed in an algorithm. | 7.5 | 10 | 4.5 |
E12.Q02.A04 | What is the experimental approach for measuring the running time of an algorithm? | Implement the algorithm and measure the physical running time. | Experimental means you would actually write a prototype of the algorithm and measure the time it takes to run given certain parameters. | 10 | 10 | 5 |
E12.Q02.A05 | What is the experimental approach for measuring the running time of an algorithm? | Implement the algorithm and measure the physical running time. | measuring the relationship of running an algorithm with different input sizes. | 7.5 | 10 | 4.5 |
E12.Q02.A06 | What is the experimental approach for measuring the running time of an algorithm? | Implement the algorithm and measure the physical running time. | Oposite of a theoretical assessment of the algorithm to determine runtime, but to run the code first to determine the the runtime. This is not recommended because it is a limited test. It does not include all possibilities of the data, nor the hardware used to process the data. | 8.5 | 10 | 4.5 |
E12.Q02.A07 | What is the experimental approach for measuring the running time of an algorithm? | Implement the algorithm and measure the physical running time. | not answered | 0 | 0 | 0 |
E12.Q02.A08 | What is the experimental approach for measuring the running time of an algorithm? | Implement the algorithm and measure the physical running time. | The experimental approach for measuring the running time is by using the Big O equation which tells you the running time. | 7.5 | 3 | 3 |
E12.Q02.A09 | What is the experimental approach for measuring the running time of an algorithm? | Implement the algorithm and measure the physical running time. | You create and run the algorithm multiple times, while measuring the amount of time it takes, you then average the results. | 10 | 10 | 5 |
E12.Q02.A10 | What is the experimental approach for measuring the running time of an algorithm? | Implement the algorithm and measure the physical running time. | keep a value of how many operations it takes and add to this value each time a function is called. | 7.5 | 6 | 3.5 |
E12.Q02.A11 | What is the experimental approach for measuring the running time of an algorithm? | Implement the algorithm and measure the physical running time. | BIG-OH | 6 | 3 | 2.5 |
E12.Q02.A12 | What is the experimental approach for measuring the running time of an algorithm? | Implement the algorithm and measure the physical running time. | Running the program with various input data and measuring the running time with system time. | 10 | 10 | 5 |
E12.Q02.A13 | What is the experimental approach for measuring the running time of an algorithm? | Implement the algorithm and measure the physical running time. | You run a program with different data sizes, like 10^x. As you increase x and measure the completion speeds for the program, you can find patterns and attempt the measure the running time. It's very important to keep the same software and hardware however, which makes experimental testing inferior to theoretical in t... | 6 | 10 | 4 |
E12.Q02.A14 | What is the experimental approach for measuring the running time of an algorithm? | Implement the algorithm and measure the physical running time. | to run the program through and see how many times each thing is called and the runtime of each function is based on that. | 7 | 10 | 4.5 |
E12.Q02.A15 | What is the experimental approach for measuring the running time of an algorithm? | Implement the algorithm and measure the physical running time. | the number of times a specific segments get called per unit work. | 6 | 6 | 3 |
E12.Q02.A16 | What is the experimental approach for measuring the running time of an algorithm? | Implement the algorithm and measure the physical running time. | For every call into memory, add/ multiply it into an equation of type O(n) | 6 | 3 | 2.5 |
E12.Q02.A17 | What is the experimental approach for measuring the running time of an algorithm? | Implement the algorithm and measure the physical running time. | adding a time marker at the before the algorithm is called and another time marker immediately after so that you have the change in time, then you can calculate the efficiency by the speed of the computers cpu. | 8.5 | 6 | 3.5 |
E12.Q02.A18 | What is the experimental approach for measuring the running time of an algorithm? | Implement the algorithm and measure the physical running time. | Big O(h) notation | 6 | 3 | 2.5 |
E12.Q02.A19 | What is the experimental approach for measuring the running time of an algorithm? | Implement the algorithm and measure the physical running time. | the experimental approach measures actual running time in t. t= seconds. | 10 | 10 | 5 |
E12.Q02.A20 | What is the experimental approach for measuring the running time of an algorithm? | Implement the algorithm and measure the physical running time. | running an algorithm on a specific set of data | 6 | 10 | 4 |
E12.Q02.A21 | What is the experimental approach for measuring the running time of an algorithm? | Implement the algorithm and measure the physical running time. | In experimental terms, the running time of an algorithm is measured by the number of operations required to complete the function. This number can usually be expressed in big-O notation. | 7.5 | 5 | 3.5 |
E12.Q02.A22 | What is the experimental approach for measuring the running time of an algorithm? | Implement the algorithm and measure the physical running time. | run the code for n-times and get average values, drop the constant and lowest number. for example if <br> f(x) = 3n +1<br>the running time will bef f(x) = O(n) | 9 | 5 | 4 |
E12.Q02.A23 | What is the experimental approach for measuring the running time of an algorithm? | Implement the algorithm and measure the physical running time. | to measure the actual time of the program to run. and calculate the running time using the input and operations done | 10 | 10 | 5 |
E12.Q02.A24 | What is the experimental approach for measuring the running time of an algorithm? | Implement the algorithm and measure the physical running time. | adding up the number of operations performed based on the worst case possible. | 6 | 4 | 2.5 |
E12.Q02.A25 | What is the experimental approach for measuring the running time of an algorithm? | Implement the algorithm and measure the physical running time. | the experimental approach would be to run through the algorithm and see how long it takes | 10 | 10 | 5 |
E12.Q02.A26 | What is the experimental approach for measuring the running time of an algorithm? | Implement the algorithm and measure the physical running time. | trying it with different sets of inputs, and measuring the amount of time that the algorithm actually takes. | 10 | 10 | 5 |
E12.Q02.A27 | What is the experimental approach for measuring the running time of an algorithm? | Implement the algorithm and measure the physical running time. | running the input with various inputs measuring the running time with system time | 7.5 | 10 | 4.5 |
E12.Q04.A00 | Briefly, how does selection sort work? | It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth. | it scans the list and selects the smallest(largest) element and places it in the front, increment the curPtr by one, scan the list again for the next smallest(largest) element and place it in with respect with the other sorted elements. | 10 | 10 | 5 |
E12.Q04.A01 | Briefly, how does selection sort work? | It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth. | Selection sort searches the array for the lowest value and swaps it with the first value in the array. Then searches for the next lowest value and swaps it with the second item in the array, and so on. | 10 | 10 | 5 |
E12.Q04.A02 | Briefly, how does selection sort work? | It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth. | Compare the largest element to the front element and swap data according to value if needed. | 7.5 | 8 | 4 |
E12.Q04.A03 | Briefly, how does selection sort work? | It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth. | Selection sort is a sorting algorithm that divides a list in half and has two lists. It then compares the first elements in both these lists and puts these elements in another list, having the smaller element before the bigger one. | 6 | 2 | 2 |
E12.Q04.A04 | Briefly, how does selection sort work? | It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth. | Iterate through the list (assume list of integers), find the smallest one, and put it in a separate "sorted" list... then traverse again and find the next smallest, and move it to the sorted section... and repeat until you run out of elements to sort. | 9 | 10 | 5 |
E12.Q04.A05 | Briefly, how does selection sort work? | It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth. | selection sort selects the smallest element out of the list then the second smallest ....and sorts them acordingly. | 10 | 10 | 5 |
E12.Q04.A06 | Briefly, how does selection sort work? | It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth. | You select the smallest element and place it on the left. You select the smallest element and sort it with respect the the item already on the left. You continue this till the end of the collection of items. | 10 | 10 | 5 |
E12.Q04.A07 | Briefly, how does selection sort work? | It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth. | A selection sort scrolls through the data structure looking for the lowest (or highest) unsorted piece of data, moves it to the held spot, increments that spot by one, and starts the process over. | 10 | 10 | 5 |
E12.Q04.A08 | Briefly, how does selection sort work? | It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth. | Selection sort works by finding the smallest element and then compares it with the largest and sorts the elements. | 7.5 | 0 | 2 |
E12.Q04.A09 | Briefly, how does selection sort work? | It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth. | Selection sort is usually a recursive sorting method where you divide the elements to be sorted in half repeatedly. You then sort the smallest case, then work your way up, sorting each until they are all sorted. | 8 | 2 | 2.5 |
E12.Q04.A10 | Briefly, how does selection sort work? | It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth. | goes to the middle of the list, checks to see if it is greater or less then the value given and moves through the list accordingly to add the value into the proper place. | 7.5 | 0 | 2 |
E12.Q04.A11 | Briefly, how does selection sort work? | It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth. | selection sort finds the lowest element in the data set and places it behind the pivot point. | 7.5 | 10 | 4.5 |
E12.Q04.A12 | Briefly, how does selection sort work? | It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth. | Selection sort iterates through the array one element at a time, seeking the least value from the right and replacing the current value with it. | 7.5 | 10 | 4.5 |
E12.Q04.A13 | Briefly, how does selection sort work? | It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth. | Selection sort traverses an unsorted array looking for the smallest value, when it's found it is put at the beginning of the unsorted array. Performed several times, this will output a sorted array. | 10 | 10 | 5 |
E12.Q04.A14 | Briefly, how does selection sort work? | It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth. | it runs through the list and finds the smallest (or largest) value and puts it at the appropriate position | 7.5 | 10 | 4.5 |
E12.Q04.A15 | Briefly, how does selection sort work? | It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth. | pick a number, and set all values less than that number to the left, while all numbers on the right of that number is larger. | 10 | 2 | 3 |
E12.Q04.A16 | Briefly, how does selection sort work? | It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth. | It takes the largest item in the unsorted array and swaps it with last item in the unsorted array. | 7.5 | 10 | 4.5 |
E12.Q04.A17 | Briefly, how does selection sort work? | It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth. | by selecting the first object and comparing it with the next objects to find one that is smaller, if it does it switches the two. then it comes back the other way and sees if the objects previous to the last one is greater, if it does it switches them. it does this while decreasing the range it looks at until it fini... | 7.5 | 2 | 2.5 |
E12.Q04.A18 | Briefly, how does selection sort work? | It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth. | Selection sorts works by going through a certain list. Goes through the unsorted list and selecting the largest item in the list and placing it in a sorted array. There are two arrays, unsorted and sorted. Complete these steps until the list is sorted. | 7.5 | 10 | 4.5 |
E12.Q04.A19 | Briefly, how does selection sort work? | It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth. | selection sort works by pulling all of the values off to the side, leaving one value in the list. It will then insert a value into the list. if the value is bigger it will go to the right, if smaller if will go to the left. | 7.5 | 2 | 2.5 |
E12.Q04.A20 | Briefly, how does selection sort work? | It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth. | selection sort searches for the smallest element of the remaining data organization and places it at the largest point of the new data organization | 7.5 | 10 | 4.5 |
E12.Q04.A21 | Briefly, how does selection sort work? | It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth. | Selection sort sorts an array one element at at time. It first finds the element with the smallest key and puts it into the first location within its array or list, then finds the next smallest and puts it in the second location, and so on. | 10 | 10 | 5 |
E12.Q04.A22 | Briefly, how does selection sort work? | It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth. | select an element compare it with 2nd element if it is greater, swap it | 9 | 2 | 3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.