Question: How insertion sort and selection sorts are different?
Reference answer: Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list

Student answer: Insertion sort inserts the value in a presorted file to sort a set of values.\nSelection sort find the minimum number from the list and sort it in some order.
Score: 2.0

Student answer: in selection sort, we compare every element with every other element and find minimum element, which is replaced by first element. This sort algorithm works until array is sorted.\nin insertion sort, we compare elements before the selected element and swap them so that they are sorted.  
Score: 2.5

Student answer: Insertion sort has a better time complexity than the selection sort. \nAlso selection sort selects the least element and replaces it with the other.\nInsertion sort creates an array of sorted elements and inserts the element in the sorted array.
Score: 2.5

Student answer: selections picks minimum element first and insertion picks a element and put it in its correct place
Score: 2.5

Student answer: in insertion sort with the helps of two loops we compare every element with every other element present in the array whereas in selection sort we take first two elements and and compare them and then set their sorted position in this way we do with the rest of the element in the array.\nthere are difference in terms of complexities selection sort is slightly better than insertion
Score: 2.0

Student answer: In selection sort a minimum element is selected and is compared with other elements to sort.\nSelection sort works by comparing adjacent elements
Score: 2.5

Student answer: sorts are basically the sorting techniques means sorting to get the output easily and effectively\ninsertion sorts means sorting up the given data in an order and then inserting up the element which needs to be added and element that has to be added is too done in an order\nwhereas as selection sort means you are given up the data that has to be performed certain operations on it you will sort and then select sorting makes things easier
Score: 2.0

Student answer: Insertion sort and selection sort are different in the sense that in selection sort we select the element and run two loops. In the first loop we iterate through the array if there is any element in the array smaller than the selected element we swap else we continue. In the outer loop if after all the swapping takes place for the [ i ]th element we move on and repeat the same steps for the [ i+1]th element till the end of the array.\n
Score: 1.0

Student answer: selection sort works on minimum number of swaps possible
Score: 1.0

Student answer: Selection Sort is different from Insertion Sort\nin selection sort we sort our array by finding largest element one by one \nand sorting array in Length*length no of operations\nbut insertion we try to do it by key value
Score: 1.0