Viswa45/ASAG huggingface dataset:
Question: How many dimensions need to be specified when passing a multi-dimensional array as an argument to a function?
Instructor answer: All the dimensions, except the first one.
Student answer: The first dimension is not required however the subsequent dimension(s) are needed for the compiler.
Score (0-5): 5
Question: How many dimensions need to be specified when passing a multi-dimensional array as an argument to a function?
Instructor answer: All the dimensions, except the first one.
Student answer: all but the first
Score (0-5): 5
Question: How many dimensions need to be specified when passing a multi-dimensional array as an argument to a function?
Instructor answer: All the dimensions, except the first one.
Student answer: All of the dimensions must be specified.
Score (0-5): 3.5
Question: How many dimensions need to be specified when passing a multi-dimensional array as an argument to a function?
Instructor answer: All the dimensions, except the first one.
Student answer: just the first one at least.
Score (0-5): 2
Question: How many dimensions need to be specified when passing a multi-dimensional array as an argument to a function?
Instructor answer: All the dimensions, except the first one.
Student answer: Two paramaters, the array and how many columns.<br> array(a[],[3])
Score (0-5): 4
Question: How many dimensions need to be specified when passing a multi-dimensional array as an argument to a function?
Instructor answer: All the dimensions, except the first one.
Student answer: The size of the first dimension can be omitted, same as a regular array. However, for every dimension outside the first, the size of those dimensions must be specified when passed, for example, a multi-dimensional array of [2][4][6] with the name MultiArray would be passed as: "MultiArray[][4][6], 2"
Score (0-5): 4.5
Question: How many dimensions need to be specified when passing a multi-dimensional array as an argument to a function?
Instructor answer: All the dimensions, except the first one.
Student answer: Size of subsequent dimensions are required. Compiler must know how many elements to skip to move to the second element in the first dimension<br><br>
Score (0-5): 4.5
Question: How many dimensions need to be specified when passing a multi-dimensional array as an argument to a function?
Instructor answer: All the dimensions, except the first one.
Student answer: Every dimension after the first.
Score (0-5): 5
Question: How many dimensions need to be specified when passing a multi-dimensional array as an argument to a function?
Instructor answer: All the dimensions, except the first one.
Student answer: both
Score (0-5): 2.5
Question: How many dimensions need to be specified when passing a multi-dimensional array as an argument to a function?
Instructor answer: All the dimensions, except the first one.
Student answer: the size of the first dimension does not need to be specified, but all other dimensions do.
Score (0-5): 5
Question: How many dimensions need to be specified when passing a multi-dimensional array as an argument to a function?
Instructor answer: All the dimensions, except the first one.
Student answer: when passing (in main) a multidimensional array to a function, no dimensions need be specified
Score (0-5): 2
Question: How many dimensions need to be specified when passing a multi-dimensional array as an argument to a function?
Instructor answer: All the dimensions, except the first one.
Student answer: All dimensions except for the first one need to be specified when passing an array to a function, the compiler needs to know how many memory addresses to skip to make it back to the 2nd element in the first dimension.  The size of the first dimension does not need to be specified.
Score (0-5): 5
Question: How many dimensions need to be specified when passing a multi-dimensional array as an argument to a function?
Instructor answer: All the dimensions, except the first one.
Student answer: as many as there are dimensions. Most commonly just rows and columns
Score (0-5): 3.5
Question: How many dimensions need to be specified when passing a multi-dimensional array as an argument to a function?
Instructor answer: All the dimensions, except the first one.
Student answer: at least 2, but it should always equal the number of dimensions that the argument is expecting... like... <br>blah[][][][] will require 4 dimensional array input.<br>blah[][][] will require a 3 dimensional array.<br>blah[][] will require a 2 dimensional array.
Score (0-5): 3
Question: How many dimensions need to be specified when passing a multi-dimensional array as an argument to a function?
Instructor answer: All the dimensions, except the first one.
Student answer: None, just pass the array name.
Score (0-5): 2
Question: How many dimensions need to be specified when passing a multi-dimensional array as an argument to a function?
Instructor answer: All the dimensions, except the first one.
Student answer: all subsequent dimensions after the first dimension.  first is not needed to be specified.
Score (0-5): 5
Question: How many dimensions need to be specified when passing a multi-dimensional array as an argument to a function?
Instructor answer: All the dimensions, except the first one.
Student answer: all dimensions, excluding the first one.
Score (0-5): 5
Question: How many dimensions need to be specified when passing a multi-dimensional array as an argument to a function?
Instructor answer: All the dimensions, except the first one.
Student answer: all dimensions but the first<br>
Score (0-5): 5
Question: How many dimensions need to be specified when passing a multi-dimensional array as an argument to a function?
Instructor answer: All the dimensions, except the first one.
Student answer: the first needs to be specified by size and the rest need only be stated( first like this [3] then [][][])
Score (0-5): 3
Question: How many dimensions need to be specified when passing a multi-dimensional array as an argument to a function?
Instructor answer: All the dimensions, except the first one.
Student answer: one less than the number of dimensions the array contains
Score (0-5): 4.5
Question: How many dimensions need to be specified when passing a multi-dimensional array as an argument to a function?
Instructor answer: All the dimensions, except the first one.
Student answer: not answered
Score (0-5): 0
Question: How many dimensions need to be specified when passing a multi-dimensional array as an argument to a function?
Instructor answer: All the dimensions, except the first one.
Student answer: one
Score (0-5): 2
Question: How many dimensions need to be specified when passing a multi-dimensional array as an argument to a function?
Instructor answer: All the dimensions, except the first one.
Student answer: All subsequent dimensions after the first one.
Score (0-5): 5
Question: How many dimensions need to be specified when passing a multi-dimensional array as an argument to a function?
Instructor answer: All the dimensions, except the first one.
Student answer: two or more
Score (0-5): 2.5
Question: How many dimensions need to be specified when passing a multi-dimensional array as an argument to a function?
Instructor answer: All the dimensions, except the first one.
Student answer: 1 less than the total number of dimensions
Score (0-5): 4.5
Question: How many dimensions need to be specified when passing a multi-dimensional array as an argument to a function?
Instructor answer: All the dimensions, except the first one.
Student answer: Multi dimensional arrays are accessed using more than 1  index, one for each dimension at least.
Score (0-5): 3.5
Question: In one sentence, what is the main idea implemented by insertion sort?
Instructor answer: Taking one array element at a time, from left to right, it inserts it in the right position among the already sorted elements on its left.
Student answer: Takes an element of an array and compares it with the next element, depending on the values of the two elements they will switch and then the program will compare the new switched element with the next one in the array.
Score (0-5): 3
Question: In one sentence, what is the main idea implemented by insertion sort?
Instructor answer: Taking one array element at a time, from left to right, it inserts it in the right position among the already sorted elements on its left.
Student answer: Insertion sort divides the list into sorted and unsorted regions, then takes each item from the unsorted region and inserts it into its correct order in the sorted region.
Score (0-5): 5
Question: In one sentence, what is the main idea implemented by insertion sort?
Instructor answer: Taking one array element at a time, from left to right, it inserts it in the right position among the already sorted elements on its left.
Student answer: The sorted array or list is built one entry at a time.
Score (0-5): 3.5
Question: In one sentence, what is the main idea implemented by insertion sort?
Instructor answer: Taking one array element at a time, from left to right, it inserts it in the right position among the already sorted elements on its left.
Student answer: It starts with the second element and checks it to see if it is less than the element(s) to the left of it and if it is it inserts it into its corrected position.
Score (0-5): 5
Question: In one sentence, what is the main idea implemented by insertion sort?
Instructor answer: Taking one array element at a time, from left to right, it inserts it in the right position among the already sorted elements on its left.
Student answer: Compare two numbers at a time and swap until the entire list is sorted.
Score (0-5): 2
Question: In one sentence, what is the main idea implemented by insertion sort?
Instructor answer: Taking one array element at a time, from left to right, it inserts it in the right position among the already sorted elements on its left.
Student answer: Assume the first number is sorted, then move down the list and 'insert' the numbers you come across into the corresponding place on the sorted side of the list.
Score (0-5): 5
Question: In one sentence, what is the main idea implemented by insertion sort?
Instructor answer: Taking one array element at a time, from left to right, it inserts it in the right position among the already sorted elements on its left.
Student answer: insertion sort is were after k iterations the first k items in the array are sorted it take the k+1 item and inserts it into the correct position in the already sorted k elements.
Score (0-5): 4.5
Question: In one sentence, what is the main idea implemented by insertion sort?
Instructor answer: Taking one array element at a time, from left to right, it inserts it in the right position among the already sorted elements on its left.
Student answer: Looking at the 2nd element move forward and place the element in the correct spot.
Score (0-5): 4.5
Question: In one sentence, what is the main idea implemented by insertion sort?
Instructor answer: Taking one array element at a time, from left to right, it inserts it in the right position among the already sorted elements on its left.
Student answer: Starting at the beginning of an array, take each element in order and place it in it's correct position relative to all previously sorted elements.
Score (0-5): 5
Question: In one sentence, what is the main idea implemented by insertion sort?
Instructor answer: Taking one array element at a time, from left to right, it inserts it in the right position among the already sorted elements on its left.
Student answer: To sort the elements in an array by removing an element from the input data and inserting it at the correct position.
Score (0-5): 5
Question: In one sentence, what is the main idea implemented by insertion sort?
Instructor answer: Taking one array element at a time, from left to right, it inserts it in the right position among the already sorted elements on its left.
Student answer: Insertion sort removes an element from the data, and inserts it at the correct position in the already sorted list.
Score (0-5): 5
Question: In one sentence, what is the main idea implemented by insertion sort?
Instructor answer: Taking one array element at a time, from left to right, it inserts it in the right position among the already sorted elements on its left.
Student answer: Take a number and choose a pivot point and insert the number in the correct position from the pivot point.
Score (0-5): 3
Question: In one sentence, what is the main idea implemented by insertion sort?
Instructor answer: Taking one array element at a time, from left to right, it inserts it in the right position among the already sorted elements on its left.
Student answer: have a marker and sort everything to the left of the value for every new value when moving to the right.
Score (0-5): 3
Question: In one sentence, what is the main idea implemented by insertion sort?
Instructor answer: Taking one array element at a time, from left to right, it inserts it in the right position among the already sorted elements on its left.
Student answer: The main idea behind insertion sort is to take a random variable from the right and insert it in order to the left.
Score (0-5): 4.5
Question: In one sentence, what is the main idea implemented by insertion sort?
Instructor answer: Taking one array element at a time, from left to right, it inserts it in the right position among the already sorted elements on its left.
Student answer: Insertion sort progresses through a list of elements and determines where the next element should be inserted into an already sorted array starting with sorting and using the first two elements.
Score (0-5): 4.5
Question: In one sentence, what is the main idea implemented by insertion sort?
Instructor answer: Taking one array element at a time, from left to right, it inserts it in the right position among the already sorted elements on its left.
Student answer: it goes through the list only once, picking each integer and putting it in its desired position, then continuing.
Score (0-5): 4
Question: In one sentence, what is the main idea implemented by insertion sort?
Instructor answer: Taking one array element at a time, from left to right, it inserts it in the right position among the already sorted elements on its left.
Student answer: Inserting array items in to their appropriate positions from smallest to largest at a pivot which starts on the second element of the array.
Score (0-5): 3.5
Question: In one sentence, what is the main idea implemented by insertion sort?
Instructor answer: Taking one array element at a time, from left to right, it inserts it in the right position among the already sorted elements on its left.
Student answer: Insert the item into its proper position by shifting larger sorted array values to the right.<br>
Score (0-5): 3
Question: In one sentence, what is the main idea implemented by insertion sort?
Instructor answer: Taking one array element at a time, from left to right, it inserts it in the right position among the already sorted elements on its left.
Student answer: a comparison sort in which the sorted array is built one entry at a time
Score (0-5): 4
Question: In one sentence, what is the main idea implemented by insertion sort?
Instructor answer: Taking one array element at a time, from left to right, it inserts it in the right position among the already sorted elements on its left.
Student answer: Insertion sort is an algorithm where the first element of the array is in the sorted list, all the other pick one by one and taken from the unsorted array, to the sorted array.
Score (0-5): 4.5
Question: In one sentence, what is the main idea implemented by insertion sort?
Instructor answer: Taking one array element at a time, from left to right, it inserts it in the right position among the already sorted elements on its left.
Student answer: Every iteration of an insertion sort takes away an element from the input data, inserting it at the right position in the sorted list.
Score (0-5): 5
Question: In one sentence, what is the main idea implemented by insertion sort?
Instructor answer: Taking one array element at a time, from left to right, it inserts it in the right position among the already sorted elements on its left.
Student answer: the insertion sort creates a new array and inserts each item in its place with respect to the new array.
Score (0-5): 4
Question: In one sentence, what is the main idea implemented by insertion sort?
Instructor answer: Taking one array element at a time, from left to right, it inserts it in the right position among the already sorted elements on its left.
Student answer: Insertion sort takes each entitity of an unsorted array in order, and sorts it into the correct position between the entities it has sorted.
Score (0-5): 5
Question: In one sentence, what is the main idea implemented by insertion sort?
Instructor answer: Taking one array element at a time, from left to right, it inserts it in the right position among the already sorted elements on its left.
Student answer: it takes the second element and swaps it with the 1st if it is less and keeps it there if its larger, then it goes to the third element and inserts it in the right places with respect to the first 2 elements and so on...
Score (0-5): 5
Question: In one sentence, what is the main idea implemented by insertion sort?
Instructor answer: Taking one array element at a time, from left to right, it inserts it in the right position among the already sorted elements on its left.
Student answer: Starting with the first element in the array, each following element is put in place by determining if it is smaller or larger than the starting element.
Score (0-5): 4
Question: In one sentence, what is the main idea implemented by insertion sort?
Instructor answer: Taking one array element at a time, from left to right, it inserts it in the right position among the already sorted elements on its left.
Student answer: one by one, each item is taken and placed into the correct place in the sorted portion of the array until there are no more items
Score (0-5): 4.5
Question: In one sentence, what is the main idea implemented by insertion sort?
Instructor answer: Taking one array element at a time, from left to right, it inserts it in the right position among the already sorted elements on its left.
Student answer: you take each element and insert it in the correct position with respect to all the elements before it
Score (0-5): 5
Question: In one sentence, what is the main idea implemented by insertion sort?
Instructor answer: Taking one array element at a time, from left to right, it inserts it in the right position among the already sorted elements on its left.
Student answer: Insertion sort is a simple sorting algorithm, a comparison sort in which the sorted array (or list) is built one entry at a time.
Score (0-5): 4
Question: In one sentence, what is the main idea implemented by selection sort?
Instructor answer: Taking one array element at a time, from left to right, it identifies the minimum from the remaining elements and swaps it with the current element.
Student answer: Searches an array for the largest or the smallest element and is moved out to the front of the array then it will search for the next largest or the smallest element to move out to the front
Score (0-5): 5
Question: In one sentence, what is the main idea implemented by selection sort?
Instructor answer: Taking one array element at a time, from left to right, it identifies the minimum from the remaining elements and swaps it with the current element.
Student answer: Selection sort searches the whole array for the largest item and puts it at the end of the array, then searches for the second largest item and puts it at the second to last spot and so on.
Score (0-5): 4.5
Question: In one sentence, what is the main idea implemented by selection sort?
Instructor answer: Taking one array element at a time, from left to right, it identifies the minimum from the remaining elements and swaps it with the current element.
Student answer: Finds the minimum value and swap it with the value in the first position.
Score (0-5): 5
Question: In one sentence, what is the main idea implemented by selection sort?
Instructor answer: Taking one array element at a time, from left to right, it identifies the minimum from the remaining elements and swaps it with the current element.
Student answer: It finds the minimum element in the array and swaps it with the first element then repeats this step swapping the minimum element with nth positions in the array.
Score (0-5): 5
Question: In one sentence, what is the main idea implemented by selection sort?
Instructor answer: Taking one array element at a time, from left to right, it identifies the minimum from the remaining elements and swaps it with the current element.
Student answer: Find the lowest value and place it at the front, then find the next lowest and place it in front of the last value, etc.
Score (0-5): 4.5
Question: In one sentence, what is the main idea implemented by selection sort?
Instructor answer: Taking one array element at a time, from left to right, it identifies the minimum from the remaining elements and swaps it with the current element.
Student answer: Cycle through the unsorted list, place the minimum in the next slot in the sorted list, and repeat.
Score (0-5): 4.5
Question: In one sentence, what is the main idea implemented by selection sort?
Instructor answer: Taking one array element at a time, from left to right, it identifies the minimum from the remaining elements and swaps it with the current element.
Student answer: find the minimum value in the list swap it with the first element in the list the find the second largest and swap it with the second element in the array continue like this until  the array is sorted.
Score (0-5): 5
Question: In one sentence, what is the main idea implemented by selection sort?
Instructor answer: Taking one array element at a time, from left to right, it identifies the minimum from the remaining elements and swaps it with the current element.
Student answer: Find the smallest and put it in the current position till you get to the end.
Score (0-5): 5
Question: In one sentence, what is the main idea implemented by selection sort?
Instructor answer: Taking one array element at a time, from left to right, it identifies the minimum from the remaining elements and swaps it with the current element.
Student answer: Find the lowest unsorted value in the array and place it at the current position (starting at the first element in the array) and advance the "current" position by one.
Score (0-5): 5
Question: In one sentence, what is the main idea implemented by selection sort?
Instructor answer: Taking one array element at a time, from left to right, it identifies the minimum from the remaining elements and swaps it with the current element.
Student answer: To sort the elements by comparing two elements and swapping the smaller one to sort the elements in the array.
Score (0-5): 3.5
Question: In one sentence, what is the main idea implemented by selection sort?
Instructor answer: Taking one array element at a time, from left to right, it identifies the minimum from the remaining elements and swaps it with the current element.
Student answer: Selection sort finds the minimum value in the list, swaps it with the first value in the list, and repeats throughout the list.
Score (0-5): 4.5
Question: In one sentence, what is the main idea implemented by selection sort?
Instructor answer: Taking one array element at a time, from left to right, it identifies the minimum from the remaining elements and swaps it with the current element.
Student answer: Select the minimum number from the array and put it in the current position, then move on
Score (0-5): 5
Question: In one sentence, what is the main idea implemented by selection sort?
Instructor answer: Taking one array element at a time, from left to right, it identifies the minimum from the remaining elements and swaps it with the current element.
Student answer: Find the lowest value and place it in the front of the list and swap it with that value. Continue moving right.
Score (0-5): 5
Question: In one sentence, what is the main idea implemented by selection sort?
Instructor answer: Taking one array element at a time, from left to right, it identifies the minimum from the remaining elements and swaps it with the current element.
Student answer: The main idea behind selection sort is to take the least variable from the right and put it directly to the left.
Score (0-5): 4.5
Question: In one sentence, what is the main idea implemented by selection sort?
Instructor answer: Taking one array element at a time, from left to right, it identifies the minimum from the remaining elements and swaps it with the current element.
Student answer: Find the smallest value in the list and make it the first element, then find the smallest value of the leftover list and make it the first element of the leftover list and continue until the list is sorted.
Score (0-5): 5
Question: In one sentence, what is the main idea implemented by selection sort?
Instructor answer: Taking one array element at a time, from left to right, it identifies the minimum from the remaining elements and swaps it with the current element.
Student answer: It runs through and finds the lowest (or highest) value and puts it in its desired position.
Score (0-5): 4.5
Question: In one sentence, what is the main idea implemented by selection sort?
Instructor answer: Taking one array element at a time, from left to right, it identifies the minimum from the remaining elements and swaps it with the current element.
Student answer: Places the smallest item in the list at position 1, and then proceeds to each value until the last position of the ray is reached.
Score (0-5): 5
Question: In one sentence, what is the main idea implemented by selection sort?
Instructor answer: Taking one array element at a time, from left to right, it identifies the minimum from the remaining elements and swaps it with the current element.
Student answer: Search for the largest item in an array and swap it with the last unsorted item.<br>
Score (0-5): 4.5
Question: In one sentence, what is the main idea implemented by selection sort?
Instructor answer: Taking one array element at a time, from left to right, it identifies the minimum from the remaining elements and swaps it with the current element.
Student answer: finds the smallest element and places in 1st position. then the process is repeated on the rest of the array.
Score (0-5): 5
Question: In one sentence, what is the main idea implemented by selection sort?
Instructor answer: Taking one array element at a time, from left to right, it identifies the minimum from the remaining elements and swaps it with the current element.
Student answer: Selection sort is an algorithm that selects the larges item the array and puts it in its place; then select the next largest until the array is sorted
Score (0-5): 4.5
Question: In one sentence, what is the main idea implemented by selection sort?
Instructor answer: Taking one array element at a time, from left to right, it identifies the minimum from the remaining elements and swaps it with the current element.
Student answer: Select the smallest number in the list and move it to the front of the list and then advance to the next number.
Score (0-5): 5
Question: In one sentence, what is the main idea implemented by selection sort?
Instructor answer: Taking one array element at a time, from left to right, it identifies the minimum from the remaining elements and swaps it with the current element.
Student answer: the selection sort chooses the largest or smallest value in an unsorted list and creates a new list using the selection depending on how it is sorted.
Score (0-5): 4.5
Question: In one sentence, what is the main idea implemented by selection sort?
Instructor answer: Taking one array element at a time, from left to right, it identifies the minimum from the remaining elements and swaps it with the current element.
Student answer: Selection sort finds the smallest number left unsorted in an array, and puts it at the end of what it has sorted
Score (0-5): 4.5
Question: In one sentence, what is the main idea implemented by selection sort?
Instructor answer: Taking one array element at a time, from left to right, it identifies the minimum from the remaining elements and swaps it with the current element.
Student answer: selects the minimum from the remaining elements of the array, and palces the miminum in the current position and moves to the next position
Score (0-5): 5
Question: In one sentence, what is the main idea implemented by selection sort?
Instructor answer: Taking one array element at a time, from left to right, it identifies the minimum from the remaining elements and swaps it with the current element.
Student answer: To put the biggest element at the end of the list and place the next highest element behind it, and so on.
Score (0-5): 3.5
Question: In one sentence, what is the main idea implemented by selection sort?
Instructor answer: Taking one array element at a time, from left to right, it identifies the minimum from the remaining elements and swaps it with the current element.
Student answer: the sort finds the largest item and places it at the end, then then next largest is found and placed next to last, continue until there is only one number left, this is the beginning of the sorted array
Score (0-5): 4.5
Question: In one sentence, what is the main idea implemented by selection sort?
Instructor answer: Taking one array element at a time, from left to right, it identifies the minimum from the remaining elements and swaps it with the current element.
Student answer: you loop through the entire list, and for each iteration you find the smallest element and move it to the current position.
Score (0-5): 5
Question: In one sentence, what is the main idea implemented by selection sort?
Instructor answer: Taking one array element at a time, from left to right, it identifies the minimum from the remaining elements and swaps it with the current element.
Student answer: Find the minimum value in the list swap it with the value in the first position; repeat the steps above for remainder of the list(starting in the second position.
Score (0-5): 5
Question: What is the number of operations for insertion sort under a best-case scenario, and what is the best-case scenario?
Instructor answer: N (the length of the array) operations achieved for a sorted array.
Student answer: The run time for this sorting program is n^2.  Best case is the list is already sorted, worst case is the list is sorted but in reverse.
Score (0-5): 3.5
Question: What is the number of operations for insertion sort under a best-case scenario, and what is the best-case scenario?
Instructor answer: N (the length of the array) operations achieved for a sorted array.
Student answer: Insertion sort is O(n) and performs n-1 operations in the best-case scenario, which is when the list or array is already sorted.
Score (0-5): 4.5
Question: What is the number of operations for insertion sort under a best-case scenario, and what is the best-case scenario?
Instructor answer: N (the length of the array) operations achieved for a sorted array.
Student answer: The number of operations for insertions sort, under best-case, is  n(n-1)/2. The best case for insertion sort is on a sorted list where it runs is O(n).
Score (0-5): 3
Question: What is the number of operations for insertion sort under a best-case scenario, and what is the best-case scenario?
Instructor answer: N (the length of the array) operations achieved for a sorted array.
Student answer: Best case would be O(n) or n-1, because that's what it takes to scan the array and make one swap. The array would then be sorted and would take only 1 operation.
Score (0-5): 4
Question: What is the number of operations for insertion sort under a best-case scenario, and what is the best-case scenario?
Instructor answer: N (the length of the array) operations achieved for a sorted array.
Student answer: Best case-1<br>Worst Case-N
Score (0-5): 2
Question: What is the number of operations for insertion sort under a best-case scenario, and what is the best-case scenario?
Instructor answer: N (the length of the array) operations achieved for a sorted array.
Student answer: It will do (n) operations where (n) is the number of elements in the array. Best case is when all the elements are already sorted.
Score (0-5): 5
Question: What is the number of operations for insertion sort under a best-case scenario, and what is the best-case scenario?
Instructor answer: N (the length of the array) operations achieved for a sorted array.
Student answer: O(n)
Score (0-5): 3.5
Question: What is the number of operations for insertion sort under a best-case scenario, and what is the best-case scenario?
Instructor answer: N (the length of the array) operations achieved for a sorted array.
Student answer: Best case is all elements sorted.<br>n-1.
Score (0-5): 4
Question: What is the number of operations for insertion sort under a best-case scenario, and what is the best-case scenario?
Instructor answer: N (the length of the array) operations achieved for a sorted array.
Student answer: The best case scenario for an insertion sort, where all the elements of the array have been already sorted, will cause the for loop to iterate "x" times ("x" being the number of elements in the array) and the while loop to never have to iterate, resulting in the insertion sort to require "x" operations.
Score (0-5): 5
Question: What is the number of operations for insertion sort under a best-case scenario, and what is the best-case scenario?
Instructor answer: N (the length of the array) operations achieved for a sorted array.
Student answer: 1 operation. the best case scenario s where it is already sorted and does one comparision.
Score (0-5): 3
Question: What is the number of operations for insertion sort under a best-case scenario, and what is the best-case scenario?
Instructor answer: N (the length of the array) operations achieved for a sorted array.
Student answer: n operations, where n is the number of items.
Score (0-5): 4
Question: What is the number of operations for insertion sort under a best-case scenario, and what is the best-case scenario?
Instructor answer: N (the length of the array) operations achieved for a sorted array.
Student answer: n-1
Score (0-5): 3.5
Question: What is the number of operations for insertion sort under a best-case scenario, and what is the best-case scenario?
Instructor answer: N (the length of the array) operations achieved for a sorted array.
Student answer: O(n), the list is already sorted.
Score (0-5): 4.5
Question: What is the number of operations for insertion sort under a best-case scenario, and what is the best-case scenario?
Instructor answer: N (the length of the array) operations achieved for a sorted array.
Student answer: Insertion sort will take n-1 operations if the array is in reverse order.
Score (0-5): 4
Question: What is the number of operations for insertion sort under a best-case scenario, and what is the best-case scenario?
Instructor answer: N (the length of the array) operations achieved for a sorted array.
Student answer: In the best case scenario of an already sorted list, insertion sort will progress once through the list.  So the number of operations is directly proportional to the number of elements in the list.  Also noted as O(n) in big o notation.<br>
Score (0-5): 5
Question: What is the number of operations for insertion sort under a best-case scenario, and what is the best-case scenario?
Instructor answer: N (the length of the array) operations achieved for a sorted array.
Student answer: 1 where there is a list of two ints and only one must be moved.
Score (0-5): 2.5
Question: What is the number of operations for insertion sort under a best-case scenario, and what is the best-case scenario?
Instructor answer: N (the length of the array) operations achieved for a sorted array.
Student answer: Best case is N, while the worst case is N factorial.
Score (0-5): 3
Question: What is the number of operations for insertion sort under a best-case scenario, and what is the best-case scenario?
Instructor answer: N (the length of the array) operations achieved for a sorted array.
Student answer: n-1<br>The best case is when the array is already sorted.
Score (0-5): 4.5
Question: What is the number of operations for insertion sort under a best-case scenario, and what is the best-case scenario?
Instructor answer: N (the length of the array) operations achieved for a sorted array.
Student answer: worst case its = O(n) time<br>best case its = O(n^2) time
Score (0-5): 3
Question: What is the number of operations for insertion sort under a best-case scenario, and what is the best-case scenario?
Instructor answer: N (the length of the array) operations achieved for a sorted array.
Student answer: N number of times.  Where N equals the number of elements in the list.  Best-case scenario is that the elements in the list are already sorted.
Score (0-5): 5
Question: What is the number of operations for insertion sort under a best-case scenario, and what is the best-case scenario?
Instructor answer: N (the length of the array) operations achieved for a sorted array.
Student answer: the best case scenario for insertion sort is a list that is already sorted. the number of operations would be the same as the number of elements
Score (0-5): 5
Question: What is the number of operations for insertion sort under a best-case scenario, and what is the best-case scenario?
Instructor answer: N (the length of the array) operations achieved for a sorted array.
Student answer: insertion sort will make zero operations (and length - 1 comparisons) in the best case scenario, that is, when the array its given is already in order.
Score (0-5): 3.5
Question: What is the number of operations for insertion sort under a best-case scenario, and what is the best-case scenario?
Instructor answer: N (the length of the array) operations achieved for a sorted array.
Student answer: theta(n)<br>the best case senario is that everything is already sorted
Score (0-5): 4.5
Question: What is the number of operations for insertion sort under a best-case scenario, and what is the best-case scenario?
Instructor answer: N (the length of the array) operations achieved for a sorted array.
Student answer: n operations<br><br>The best case scenario is when all the numbers are in increasing order.
Score (0-5): 5
Question: What is the number of operations for insertion sort under a best-case scenario, and what is the best-case scenario?
Instructor answer: N (the length of the array) operations achieved for a sorted array.
Student answer: it could be considered that having only one item would be the easiest to sort, but this could also be a trivial result as nothing is moved<br><br>having two items allows the algorithm to sort the items into the correct order
Score (0-5): 2.5
Question: What is the number of operations for insertion sort under a best-case scenario, and what is the best-case scenario?
Instructor answer: N (the length of the array) operations achieved for a sorted array.
Student answer: the best case is if it only has to look through the list once. The best case scenario is when it goes through the list and doesn't have to make any changes (the list is already sorted)
Score (0-5): 4
Question: What is the number of operations for insertion sort under a best-case scenario, and what is the best-case scenario?
Instructor answer: N (the length of the array) operations achieved for a sorted array.
Student answer: very simplistic it moves one element from the list by one and inserting them in their correct position into a new slot then starting over. best case is (0)1
Score (0-5): 2.5
Question: What is the base case for a recursive implementation of merge sort?
Instructor answer: When the size of the array to be sorted is 1 (or 2)
Student answer: The base case for a recursive merge sort is one number.  One number by itself is a sorted list, regardless of what number it is.
Score (0-5): 5
Question: What is the base case for a recursive implementation of merge sort?
Instructor answer: When the size of the array to be sorted is 1 (or 2)
Student answer: The base case for a recursive implementation of merge sort is when the sequence being passed to merge sort has less than 2 elements.
Score (0-5): 5
Question: What is the base case for a recursive implementation of merge sort?
Instructor answer: When the size of the array to be sorted is 1 (or 2)
Student answer: The base case for a recursive implementation of merge sort is one.
Score (0-5): 5
Question: What is the base case for a recursive implementation of merge sort?
Instructor answer: When the size of the array to be sorted is 1 (or 2)
Student answer: The best case is the same as the worst case O(n log n) for a recursive merge sort.
Score (0-5): 2
Question: What is the base case for a recursive implementation of merge sort?
Instructor answer: When the size of the array to be sorted is 1 (or 2)
Student answer: there is one object in the split array to sort.
Score (0-5): 5
Question: What is the base case for a recursive implementation of merge sort?
Instructor answer: When the size of the array to be sorted is 1 (or 2)
Student answer: The base case is when the length of the current array is 1.
Score (0-5): 5
Question: What is the base case for a recursive implementation of merge sort?
Instructor answer: When the size of the array to be sorted is 1 (or 2)
Student answer: O(nlog(n))
Score (0-5): 2.5
Question: What is the base case for a recursive implementation of merge sort?
Instructor answer: When the size of the array to be sorted is 1 (or 2)
Student answer: Best case is one element.  One element is sorted.
Score (0-5): 5
Question: What is the base case for a recursive implementation of merge sort?
Instructor answer: When the size of the array to be sorted is 1 (or 2)
Student answer: If the array being sorted has 0 or 1 elements
Score (0-5): 4.5
Question: What is the base case for a recursive implementation of merge sort?
Instructor answer: When the size of the array to be sorted is 1 (or 2)
Student answer: T(n) = 0, if n&lt;2.
Score (0-5): 4
Question: What is the base case for a recursive implementation of merge sort?
Instructor answer: When the size of the array to be sorted is 1 (or 2)
Student answer: A list size of 1, where it is already sorted.
Score (0-5): 5
Question: What is the base case for a recursive implementation of merge sort?
Instructor answer: When the size of the array to be sorted is 1 (or 2)
Student answer: Single element in the array
Score (0-5): 5
Question: What is the base case for a recursive implementation of merge sort?
Instructor answer: When the size of the array to be sorted is 1 (or 2)
Student answer: O(nlog(n))
Score (0-5): 2
Question: What is the base case for a recursive implementation of merge sort?
Instructor answer: When the size of the array to be sorted is 1 (or 2)
Student answer: n * log( n )
Score (0-5): 2
Question: What is the base case for a recursive implementation of merge sort?
Instructor answer: When the size of the array to be sorted is 1 (or 2)
Student answer: A list or array of only 1 element.
Score (0-5): 5
Question: What is the base case for a recursive implementation of merge sort?
Instructor answer: When the size of the array to be sorted is 1 (or 2)
Student answer: where you only must merge sort once
Score (0-5): 3.5
Question: What is the base case for a recursive implementation of merge sort?
Instructor answer: When the size of the array to be sorted is 1 (or 2)
Student answer: A single Element on the Array.
Score (0-5): 5
Question: What is the base case for a recursive implementation of merge sort?
Instructor answer: When the size of the array to be sorted is 1 (or 2)
Student answer: There is only one element in the subarray.
Score (0-5): 5
Question: What is the base case for a recursive implementation of merge sort?
Instructor answer: When the size of the array to be sorted is 1 (or 2)
Student answer: if the array length is less than or equal to 1, then that array is returned to the other array and merged together
Score (0-5): 4.5
Question: What is the base case for a recursive implementation of merge sort?
Instructor answer: When the size of the array to be sorted is 1 (or 2)
Student answer: if (right &gt; left)<br>  {<br>    mid = (right + left) / 2;<br>    m_sort(numbers, temp, left, mid);<br>    m_sort(numbers, temp, mid+1, right);<br><br>    merge(numbers, temp, left, mid+1, right);<br>  }<br>
Score (0-5): 2
Question: What is the base case for a recursive implementation of merge sort?
Instructor answer: When the size of the array to be sorted is 1 (or 2)
Student answer: The sequence of numbers has zero or one elements.
Score (0-5): 5
Question: What is the base case for a recursive implementation of merge sort?
Instructor answer: When the size of the array to be sorted is 1 (or 2)
Student answer: one element in an array
Score (0-5): 5
Question: What is the base case for a recursive implementation of merge sort?
Instructor answer: When the size of the array to be sorted is 1 (or 2)
Student answer: array of length 1
Score (0-5): 5
Question: What is the base case for a recursive implementation of merge sort?
Instructor answer: When the size of the array to be sorted is 1 (or 2)
Student answer: the array has one element
Score (0-5): 5
Question: What is the base case for a recursive implementation of merge sort?
Instructor answer: When the size of the array to be sorted is 1 (or 2)
Student answer: When there is only one element in the array, or when the starting element in the array is the same as the ending element.
Score (0-5): 4.5
Question: What is the base case for a recursive implementation of merge sort?
Instructor answer: When the size of the array to be sorted is 1 (or 2)
Student answer: when each half or the original array has nothing else to sort, and puts the halfs back together
Score (0-5): 2.5
Question: What is the base case for a recursive implementation of merge sort?
Instructor answer: When the size of the array to be sorted is 1 (or 2)
Student answer: the size of the list being sent is &lt;= 1
Score (0-5): 4.5
Question: What is the base case for a recursive implementation of merge sort?
Instructor answer: When the size of the array to be sorted is 1 (or 2)
Student answer: O(n log n)
Score (0-5): 2
Question: What is a pointer?
Instructor answer: A variable that contains the address in memory of another variable.
Student answer: Its a location in memory that contains the memory address of another location in memory that contains information.
Score (0-5): 5
Question: What is a pointer?
Instructor answer: A variable that contains the address in memory of another variable.
Student answer: A pointer is a variable that contains a memory address as its value.
Score (0-5): 5
Question: What is a pointer?
Instructor answer: A variable that contains the address in memory of another variable.
Student answer: A pointer is a variable which stores the address of another variable.
Score (0-5): 5
Question: What is a pointer?
Instructor answer: A variable that contains the address in memory of another variable.
Student answer: Pointers are variables that contain as their values memory addresses of other variables.
Score (0-5): 5
Question: What is a pointer?
Instructor answer: A variable that contains the address in memory of another variable.
Student answer: A data type whose value refers to another value stored elsewhere in the computer memory using its address.
Score (0-5): 4.5
Question: What is a pointer?
Instructor answer: A variable that contains the address in memory of another variable.
Student answer: a pointer holds a memory location
Score (0-5): 4.5
Question: What is a pointer?
Instructor answer: A variable that contains the address in memory of another variable.
Student answer: a name that represents actual location or value of a data type.<br>int *bPtr points to an integer value.
Score (0-5): 4.5
Question: What is a pointer?
Instructor answer: A variable that contains the address in memory of another variable.
Student answer: A variable that stores the address of another variable
Score (0-5): 5
Question: What is a pointer?
Instructor answer: A variable that contains the address in memory of another variable.
Student answer: a pointer is a programming language data type whose value refers directly to (or “points to”) another value stored elsewhere in the computer memory using its address
Score (0-5): 5