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

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

Student answer: The sorted array or list is built one entry at a time.
Score (0-5): 3.5

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

Student answer: Compare two numbers at a time and swap until the entire list is sorted.
Score (0-5): 2

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

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

Student answer: Looking at the 2nd element move forward and place the element in the correct spot.
Score (0-5): 4.5

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

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

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

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

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

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

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

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

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

Student answer: Insert the item into its proper position by shifting larger sorted array values to the right.<br>
Score (0-5): 3

Student answer: a comparison sort in which the sorted array is built one entry at a time
Score (0-5): 4

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

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

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

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

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

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

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

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

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