Harsh-7300/dataset huggingface dataset:
Question: What is linear searching?
Reference answer: Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.

Student answer: Stacks work in the way of FIFO (First in first out ) method. It is a data structure which is used to efficiently manipulate data in a way such that the element on the top of the stack goes out and when output is displayed or accessed and there when we input any element in the stack, it goes on top of it. Any algorithm or problem which benefits from the same uses stack.
Score: 2.0

Student answer: Traversing the whole data structure and searching whether the required element in the data structure or not.
Score: 2.0

Student answer: When we are provided with data, for example in the form of an array. And we need to search for an element in the array of datas. So we can traverse throughout the array and look for the data. We can maintain a flag variable to mark the existence of the data. We do this in linear time because in the worst case we will have to traverse through all the data provided. This is linear time searching. 
Score: 2.0

Student answer: Linear searching is searching technique/algorithm in which our algorithm traverse through our data single time.
Score: 2.0

Student answer: Linear searching a searching technique for array/linked list which is used to find inputted element by traversing  the array/linked list one by one from starting till element is found. Its complexity is O(n). 
Score: 2.0

Student answer: The search that can be completed in linear time is linear searching.
Score: 2.0

Student answer: It is a type of search in which each we take the element to be searched and it is being compared to all the elements present in the array. 
Score: 2.0

Student answer: Searching elements in a data structure or algorithm where all the elements being searched at the time are at the same level.\nExample: Level-based search in Binary Search Trees.
Score: 2.0

Student answer: linear searching is a technique in which we go to every possible position one by one in a data structure and check it if it matches the given target it is done in O(n) complexity
Score: 2.0

Student answer: searching an element of an array and comparing them with all the elements present in the array
Score: 2.0

Student answer: linear search involves checking each element of the array with the input . A for loop is run and an if condition is put inside it to check if the required value is in the array. The time complexity is n.\narr[n];\ncin>> x;\nfor(int i=0; i<n; i++)\n{  if(x==arr[i])\n   {  cout<<\
Score: 2.0

Student answer: in linear searching we traverse all the element in the given data structure . it is a brute force approach. if size of data structure is n than its time complexity is O(n).
Score: 2.0
Question: What is linear searching?
Reference answer: Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.

Student answer: Linear searching is a type of brute force searching technique in which we search the desired element for visiting each and every element stored. Time complexity is O(n)
Score: 2.0

Student answer: it is a type of a brute force searching technique in which we match a particular element from each element of the vector/array,right from the beginning ,till we have found that element.
Score: 2.5

Student answer: In linear searching, we are given an element that we need to find. We can take all elements as an array. Then we search that element in the array. We will do something like : if arr[i]==x(element that we need) return i; suppose we find the element at i-th position, then return i.
Score: 2.5

Student answer: In linear searching to find the element we have to traversal every element one by one.
Score: 2.5

Student answer: It is the method of searching the element in one d array by traversing the array with the staring index to last index.
Score: 2.5

Student answer: when the array is traversed in a linear fashion and each element is compared to the element to be searched until it is found.
Score: 2.5

Student answer: A searching where we move only in one direction. For example, we can not search depth and breadth at the same time 
Score: 2.0

Student answer: method of searching an element via brute force approach i.e. by traversing each element  and comparing it one by one till we find the desired element
Score: 2.5

Student answer: Linear Searching means iterating the full length of the data structure to find the target value time of linear search is always O(n).
Score: 2.5

Student answer: Linear searching is a type of searching in which we traverse linearly to search an element 
Score: 2.5

Student answer: it starts from one end and go to the end point in one direction we have given a array data structure in  that linear search work like it starts from position 0 to end position without going back  
Score: 2.5

Student answer: Simply searching through all the elements in a data structure starting from first element to the last element is called linear searching.
Score: 2.5

Student answer: Linear search is an algorithm to find a specific element in an array in most simplified manner . The time complexity of linear search algorithm is O(n). As at max it can find the element at the last index. Everey time it traverse the array it matches the value with the value that needs to be find and returns whenever it comes true. 
Score: 2.5

Student answer: linear searching is a searching process in which we traverse a ptr while comparing each item \nit has a order of n^2
Score: 2.5
Question: What is linear searching?
Reference answer: Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.

Student answer: in this every index (data) of the data structure is one by one compared by the desired element. it has time complexity of O(n).
Score: 2.5

Student answer: Linear searching is the type of searching in which no condition to simplify or reduce the number of object to search is applied. It searches according to the command in whole of the object.
Score: 1.0

Student answer: Traversing and comparing each element of the provided array with the key element is called linear searching. It takes O(N) time complexity.
Score: 2.5

Student answer: searching all element in data structure in a simply in which we traverse all element one by one .
Score: 2.5

Student answer: Linear searching refers to searching each element in the array one by one from the first element till you find the target element.
Score: 2.5

Student answer: linear search is when an item is searched from a list linearly one by one i.e. start to the end\ntime complexity ; 0(n^2)
Score: 2.5

Student answer: linear searching is searching that starts at one end and goes to each element in list until all element are searched 
Score: 2.5

Student answer: suppose we are given a array \nso, linear searching means running a loop and and traversing through the array with a time complexity of O(n)
Score: 2.0

Student answer: In linear Search , we traverse the whole array and compare each element of the array with the element to be searched . The time complexity of linear search is O(n);
Score: 2.5

Student answer: Searching the element in an array by comparing it one by one to the element in the array staring from position 1 is known as linear search.
Score: 2.5

Student answer: linear search is defined as the searching  is limited to a small text or in small problems.
Score: 0.0

Student answer: in linear search time complexity is o(n) to search a element in a array it search each index for that element in the given array 
Score: 2.0

Student answer: Linear searching is the searching of the desired element in the given data by traversing all the elements of the data one by one.
Score: 2.5

Student answer: linear search is searching for a element in list by running loop and compare every element with element we have to find
Score: 2.5

Student answer: in linear searching the search the element in 
Score: 0.0

Student answer: it is a searching technique used in case of linear data structure
Score: 1.0

Student answer: In linear searching, we search the whole data from starting until we found our data, it consumes huge time in comparison of Binary Search\nWe perform linear search on unsorted data. 
Score: 2.5
Question: What is linear searching?
Reference answer: Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.

Student answer: linear searching is a type of searching in which searching is done from start and the element is searched linearly until the given value matches the element in array.\nfor example in an array of 10 elements we start from index 0 and traverse until we match the required element.
Score: 2.5

Student answer: the element are being searched one at a time, sequencly, unlike in binear searching.
Score: 2.5

Student answer: Linear Searching is an algorithm to search an element in a linear fashion.\nThis means that we would start checking the elements from the start , move forward one step at a time.\nIf the element is found , then we can return the index.\nElse we can return -1 if we do not find the target element\nIt takes O(n) time complexity to perform
Score: 2.5

Student answer: Linear searching define as the searching of an element in an array by traversing it in one direction of get required element.
Score: 2.5

Student answer: in this we start from the first element of array and continue to look the given element to be searched throughout the array and return 1 if it is present else return 0.
Score: 2.5

Student answer: the searching of  element in such a way that , we have to take comparison of first two element first and then take comparison of  it and third element .
Score: 2.0

Student answer: linear searching traverses through the array and compared every element with the element that needs to be found until it is found.
Score: 2.5

Student answer: linear search is the searching technique which help in searching a data in an system and give an output 
Score: 2.5

Student answer: searching for the given 
Score: 0.0

Student answer: linear searching is one by one check all elements and providing answer
Score: 2.5

Student answer: we use linear search to find the data in array.
Score: 2.5

Student answer: it is searching algorithm in which in which we find a element or key by travsering through each element one by one 
Score: 2.5

Student answer: linear searching the the searching technique in which we just compare and traverse the array 
Score: 2.5
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 and selection sort are different in their working principles. insertion sort uses a reference element and then sorts other elements in relation to the reference element.
Score: 2.0

Student answer:  insertion sort and selection sorts are different in a way that in  insertion  sort we insert  an element and compare the values with other nodes and swap the values time complexity can be O(n^2) but selection sort time complexity is O(n)
Score: 2.0

Student answer: the main diffrence between insertion and selection sort as in insertion sort the elements are already in sorted oreder
Score: 1.0

Student answer: Selection sort selects an element and traverse to find the least value smaller than it\nInsertion sort inserts the element at its suitable position in the array
Score: 2.5

Student answer: Insertion sort picks each of the number and places it in the correct position in the current array.\n\nSelection sort picks the element and places on basis of the number itself.
Score: 2.0

Student answer: Insertion sort takes one element and traverse every place of that array and tries to find best place for that element and place it.\nSelection sort takes one element and compare it with its next and place at its right place .\nThere are max no. of swaps in selection than insertion.
Score: 2.5

Student answer: Insertion sort has less time complexity than selection sort.
Score: 1.0

Student answer: They have different time complexities
Score: 1.0

Student answer: Both are sorting techniques and they both are different as in  insertion sort  we divide the array in two parts one the sorted one and other unsorted and we assume that the first element is already sorted and from the unsorted array we try to put that element in correct sequence in the sorted array and in selection sort we sort the elements from beginning as we find the minimum in this and with each complete iteration of j loop one element is sorted .
Score: 2.5

Student answer: insertion sort -  it check the element and insertion it to the next position if found greater than next one \nselection sort :- it selects the element from the array and sort it by the end . 
Score: 1.0

Student answer: In insertion sort  we  insert the given key and compare it with others and arrange the given array in sorted form.\nIn selection sort we select any element and assume it  primary key and then comparing each element of the array with that primary key if it lesser than it then arranging the array in sorted form.
Score: 2.5
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 is not an inplace sorting techniques, it requires external storage. Eg: the first element is stored separately and then the next element is compared and based on whether it is smaller or greater its place is decided. Its like arranging cards in two hands.\nSelection sort is inplace sorting technique in which the minimum element is searched and then swapped with its new position.    
Score: 2.5

Student answer: in selection sort the element is place dat the index I  after every iteration where as \nin insertion sort the traversal is done for the entire range of (0-n) in every iteration.
Score: 1.0

Student answer: In Insertion sort we find the correct position of ith element in the range (0 - i) positions.\n\nIn selection sort we find the smallest element than place it to the first position and so on. 
Score: 2.0

Student answer: insertion sort is a basic brute force technique where you find the smallest element in each iteration and place it in the first position in the array and maximum iterations is the size of the array\n\nSelection sort is also a basic brute force technique but here we find the largest element in each iteration and place it in the last of the array
Score: 2.0

Student answer: Linear searching is a kind of searching in which all the elements are searched 1-1.\n
Score: 0.0

Student answer: insertion sort is much like placing the element on the required position just like placing in card by moving the rest of the elements forward to create space for it whereas\nselection sort is putting the biggest the biggest elements on the last position in each step they have bit higher complexity of o(n square).
Score: 2.0

Student answer: In selection sort we select an element and compare it one by one  with every other element succeeding it for sorting the array whereas in insertion sort
Score: 1.0

Student answer: In selection sort we select an element and we compare it with every other element present , and thus succeeding in sorting it
Score: 1.0

Student answer:  element in an array. It is a simple algorithm in which we traverse entire array and check at every position if that element at that position is equal to key. Since we have to compare every element present in array to the key, time complexity of linear search is O(n). Here, n is the size of array. 
Score: 0.0

Student answer: Both  insertion sort and selection sorts  take O(n^2) time t sort an array in average and worst case . but the difference is this \ninsertion :  \n\nselection: take a values till particular index and sort them by comperisions  and repeat it till array size -1 
Score: 1.0
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 is when an element is inserted at its correct position while sorting the array.\nSelection sort is when 
Score: 1.0

Student answer: In insertion sorting the chosen element is placed at its correct position in the array while in selection sorting the smallest element is selected and placed in the sorted part of the array. Insertion sort inserts the element in its position and selection sort selects the desired element and places it in the correct position of the sorted array
Score: 2.5

Student answer: In insertion sort the element chosen is placed at its correct position in the array while in selection sort the smaller element is placed in the sorted part of the array.\nAlso, in insertion sort the element is placed at the position it belongs to and selection sort selects the position accordingly and place it at the correct position on repeatedly swapping the elements.
Score: 2.5

Student answer: In selection sort we the minimum element from the array and and put it at first position. now excluding the first element we do the same process for the remaining array until whole array get traversed and sorted. \nBut in selection sort we start prom first element pick it and compare it with other element  starting form the 0th index. if we get an element smaller than it we move to next index and as soon as we get an element larger than chosen element  we place the chosen element before it and perform the same for the remaning element until it get sorted.
Score: 2.5

Student answer: In selection sort, the index of the smallest element is found in the array and it is swapped with the first element of the array.  Second smallest is swapped with the second element. This is done until the entire array is sorted(reached the last position).\nIn insertion sort, an element is taken and is inserted in its correct position in the array.
Score: 2.5

Student answer: in selection sort we start from the first element, take it and compare it with all the other elements, as soon as we get the greater number than the chosen element , we leave the element whereas in insertion sort we continue to sort the further array.
Score: 2.0

Student answer: insertion sort:: (references : playing cards) here, we first pick a single element and after that we apply two condition\n1) if upcoming element is larger then we will place it in right side\n2) if upcoming element is lesser then we will place it in left side\n\nselection sort:: in selection sort we use two for loop and in every iteration of a outer loop we find the minimum element with the help of inner for loop and place that value in starting position(corresponding to I value) of the array with the help of swapping. \n\n\n\n
Score: 2.5
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: in selection sort minimum element is found and placed at starting of array .\nin insertion sort elements are swapped as soon as the small element is found the sort is like arranging deck of cards .
Score: 2.5

Student answer: Insertion sort helps user to insert the number in the sequence and stop as soon as the number is greater than the input number whereas in selection sorts it keeps on going till the final number.
Score: 2.0

Student answer: Insertion Sort- firstly we initialize any no.  as min. element from the given array . Then we go to the starting index of the array if that element is lesser than the min. element then swap(min. element , element) and if not then we will move to next index  we go on repeating this process till the last-1 index of the array.\nIt takes O(n) time. \nSelection Sort- It takes O(n^2) time. \n Last index gets sorted first and first index get sorted at the last .  
Score: 2.0

Student answer: The difference between insertion and selection sort is 
Score: 0.0

Student answer: In insertion sort we pick the element and insert it in its right position whereas in selection sort we select the element to placed at a particular position.
Score: 1.0

Student answer: In insertion sort we will insert the element at a specific index position of the array. Whereas in the selection sort we will first traverse the array, place the elements in the correct position by swap . The Time and Space complexities are also different. 
Score: 1.0

Student answer: Operations that can be performed on queues are:\n1. Searching.\n2. Sorting.\n3. Deletion.\n4. Insertion.\n
Score: 0.0

Student answer: insertion sort is sort of opposite to selection sort. In insertion sort, we treat the first element as already sorted and then add the rest elements one by one such that each element is added at the corrected spot such that the resulting array is already sorted. at nth turn, first n elements are sorted.
Score: 1.0

Student answer: In insertion sort, elements are inserted one by one in a sorted array, and placed at their correct position (beginning with first element, which is sorted in itself).\nIn selection sort, it traverses to each element and then searches for element smaller than it in the array ahead of it, if found swaps with it and eventually this sorting occurs from last to first.
Score: 2.5
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 works by picking an element and storing it in a temporary variable and shifting all the elements smaller that the element before it and then pushing the element in the gap created due to shifting of elements,.\nWhile selection sort selects and element and searches for an element smaller to it from the next index , when found , it swaps both the elements and continues the same for all other elements.
Score: 2.5

Student answer: in insertion sort you create an another array to store the sorted values but in selection sort whole operation of sorting the array is performed on the same array.
Score: 1.0

Student answer:  variable, then the whole array is traversed until any element gets matched with key. If no element is found, it returns NO solution but for that it needs to check with each and every element of the Array. Hence, the worst time complexity is O(n), where n is the no. of elements in the array.
Score: 0.0

Student answer: In insertion sort ,an element is put between two elements of an array while in selection sort ,the element is put ,based on the array comparison.
Score: 1.0

Student answer: Insertion sort and selection sort are different as insertion sort follows the in-place algorithms while selection sort does not.   
Score: 2.0

Student answer: Insertion Sort and selection Sort are different as in selection sort the elements are sorted by comparing with minimum element present in array while in insertion sort the element are sorted based on previous element present in whole array.
Score: 2.5

Student answer: In selection sorting after finding the largest or smallest element we insert a suitable function. Whereas in insertion sorting after finding the smallest or largest element we make a swap within the array.
Score: 2.0

Student answer: In selection sort we select the smallest or largest element in the array and swap it with the element in the starting position.\nWhereas, in insertion sort we select the smallest or largest element and insert in the appropriate location.
Score: 2.5

Student answer: In selection sort we select the smallest or largest element from the array and swap it with the starting element whereas in insertion sort we insert a element in the array and swap it with other elements until the array becomes sorted.
Score: 2.5

Student answer: Insertion sort and selection sort are different when based on their time complexity. 
Score: 1.0

Student answer: Insertion - \nselection - 
Score: 0.0

Student answer: insertion sort has a time complexity of O(nlogn) whereas Selection sort is of O(n^2)
Score: 1.0
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: In select sort we have to find the maximum element and accordingly have to put it in the end of the array but in insertion sort we have to take an element and compare it with other element until we find a larger element of which then we have to compare that larger element instead.\nSo the main difference is in insertion we compare all the element with the element in hand but in selection we find the required element and place it on the place we need it to be on the final array.
Score: 2.0

Student answer: In insertion sort we find the smallest or largest element and insert it in the front or back and keep doing this for other elements until list is sorted while in selection sort we just select random elements and swap them with biggest or smallest elements
Score: 2.0

Student answer: both defies different worst case time complexities 
Score: 0.0

Student answer: Insertion sort helps you to sort the data as soon as each element is inserted in the array on the spot. It inserts element as soon as it is entered to its correct position.\nSelection sort takes input all at one and them perform operation to sort the data. It takes first element and then swap it with its correct position and so on till the whole array is sorted. 
Score: 1.5

Student answer: In selection sort, we take minimum (or maximum) each time and put it in the right position in the list\nIn insertion sort, we check select an element, and then compare its value with every element of the list. This process is repeated for every element except the last
Score: 2.0

Student answer: In selection sort we use a selected value and then compare with other values to sort where as in insertion sort there is no selected value.\nTime Complexity of Insertion Sort=O(n log n)\nTime Complexity of Selection Sort=O(n * n)
Score: 2.0

Student answer: insert - o(n) , elements are inserted during traversal and list is sorted\nselection - o(n^2) , it is done by finding max or min element first and then all elements are sorted
Score: 2.0

Student answer: selection sort searches the unsorted part to find the minimum element while insertion 
Score: 0.0

Student answer: insertion sort we have to insert one space in steps during sorting but not in selection sort.\n
Score: 1.0

Student answer: in insertion sort we take an element and insert it in its right location by traversing through the data.\nIn selection sort the smallest element is selected and placed at it right place and the same process is repeated throughout.
Score: 2.5

Student answer: THE insertion sort inserts the values in a presorted file to sort a set of values. on the other hand, the selection sort finds the minimum number from the list and sorts it in the required order.
Score: 2.5
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 and selection sorts are 2 types of sorting techniques
Score: 1.0

Student answer: Insertion sort and selection sorts are different because in insertion sort we first insert the element and while inserting the next element we check whether its smaller than the already inserted element or not while in selection sort we first select the minimum element then we keep on inserting like that.
Score: 2.5

Student answer: In insertion sort  the  array is also divided into two parts a sorted part and an unsorted part.  In selection sort, the input array is divided into two parts a sorted part and an unsorted part. Selection sort scan the unsorted part to find the minimum element, while insertion sort scan the sorted part to find the correct position to place the element.\n\n\n\n
Score: 2.5

Student answer: insertion sort compares element to determine the position of element in a partially sorted array whereas selection sort compares the element to find the minimum element in an unsorted array 
Score: 2.5

Student answer: Insertion Sort sorts the element while it is being inserted into an array. Selection sort goes through an array in a linear fashion, sorting two adjacent elements until they are in their sorted position.
Score: 1.0

Student answer: In insertion sort, there is shifting of elements to insert the element at its particular place whereas in selection sort, there is swapping of elements.
Score: 1.0

Student answer: In insertion sort, we assume we have 2 sub arrays : one containing the lone element is considered to be sorted and the other sub array is the unsorted one. We take an element from the unsorted array and place it in the sorted array in such a way that the previously sorted array remains sorted.\nIn selection sort, we select the first element of the array and sort it with the rest of the array by swapping with the smallest element in the array. Then after coming out of the loop the second element is compared with the rest and so on.
Score: 2.5

Student answer: Selection sort: Compares elements to find the minimum element in the unsorted part and places that element in the sorted part. \nInsertion sort: Compares elements to determine the position of an element in the partially sorted array.
Score: 2.5

Student answer: In insertion sort we start iteration from 1 index and check previous one if its greater ,then start inserting/moving it right-words.\nwhere as in selection sort we start iteration from 0 index then start comparing consecutive elements if not rightly placed then swapping them .
Score: 0.0
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 a value in the array and arranges the rest with respect to that particular value while selection sort compares each particular value to sort all of the values.
Score: 1.0

Student answer: in selection sort we choose a particular element and we find its correct position by comparing it with all the elements and then placing it at the correct position\nin insertion sort we insert the particular element at a place and then move it comparing it to the elements next to it
Score: 1.0

Student answer: The main difference between insertion sort and selection sort is that insertion sort performs sorting by exchanging an element at a time with the partially sorted array while selection sort performs sorting by selecting the smallest element from the remaining elements and exchanging it with the element in the correct location.
Score: 2.5

Student answer: inserction in which each elemement is palced in the cporrect place and in selection on the base of max amd imn we place the element 
Score: 2.0

Student answer: In selection sort, we take an element and put it in it's correct position\nIn insertion sort, every element that comes in the array, we put at the correct position as it comes
Score: 1.0

Student answer: insertion sort and selection sort differs in term of stability insertion sort requires extra space where as selection sort does not require the extra space
Score: 1.0

Student answer: The insertion sort inserts the values in a presorted file to sort a set of values. On the other hand, the selection sort finds the minimum number from the list and sort it in some order.
Score: 2.0

Student answer: in selection sort we 1st take a number let it be a smallest number and iterate through the loop if any smallest number is found than swap with the number \ninsertion sort is taking minimum element and adding the number on left side if small and on the right is large
Score: 2.0

Student answer: In insertion sort we place the element to its right position but in selection sort we find the min element compare it and then make suitable swaps
Score: 2.0

Student answer: selection sort finds the smallest element then places it in first position and so on  however insertion sort 
Score: 1.0

Student answer: In Insertion Sort we compare all the elements and place them at their correct position.\nIn Selection Sort we find max and min and then compare it with the elements in the array and then swap it.
Score: 2.0

Student answer: Insertion sort inserts the value in a presorted files to sort a set of values.\nSelection sort find the minimum number from the list and sorted in some order.  
Score: 2.0
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: both the sorting approaches have different techniques , selection sort sort first two indexes and moves linearly whereas insertion sort inserts a value and checks it with every index.
Score: 2.0

Student answer: Selection sorts scans the unsorted part to find the minimum element while insertion sort scans the sorted part to find the correct position to insert.
Score: 1.0

Student answer: we insert particular element on its correct position while in selection we insert element on particular space.
Score: 2.0

Student answer: The insertion sort inserts the values in a presorted order to sort the values.\n The selection sort finds the minimum number from the list and sort it in some order
Score: 1.0

Student answer: In insertion sort element is inserted between the array elements after comparison.\nIn selection sort element is selected on by one and placed in another sorted  array.
Score: 2.0

Student answer: In insertion sort we compare and place the minimum element at the start and then perform the same operation the the next elements.
Score: 2.0

Student answer: in insertion sort, an element is picked and then placed in its correct position and in selection sort, smallest element is found in each loop and is placed in the start accordingly.
Score: 2.0

Student answer: Insertion sort: in insertion sort we start from 1st index and compare it with previous index and swap if the previous element is larger. Then we move on to 2nd index and compare it with the previous 2 elements and sap if required. Iteration continues until the array is sorted.\n\nSelection Sort: In selection sort, we take the smallest element and iterate over the remaining elements and update smallest if required. If intial smallest and updated one is now same then we swap. The loop continues till the array is sorted.
Score: 1.0

Student answer: In selection sort the minimum is selected and pushed to the sorted part of the array. In Insertion sort a duplicate value is copied and then replaced with the appropriate value to be inserted. The time complexities are also different.  
Score: 2.0

Student answer: in selection sort -we consider the first element as sorted and selects the smallest element from the rest array and put it at the starting.\nin insertion sort- we consider the first element as sorted and picks the element form the rest array and insert it at the right index depending on the pattern of sorting.
Score: 2.0
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: In Insertion sort, it proceeds from the very first value and inserts the value after thorough calculation at it's right place. Then it moves onto the other value and repeats the process. Meanwhile in Selection sort, the picked out value is chosen on the basis of a criteria (Max at times) and after proper comparison places it at the right index. And then moves on to the next clarified value.
Score: 1.0

Student answer: Searching the required element one by one in the array is called linear searching.\nComplexity is  O(n).
Score: 1.0

Student answer: insertion sort pushes the element after checking each element in position  but it is not fixed position and can vary but in selection sort once the element is checked and selected, the position will not vary.
Score: 2.0

Student answer: Insertion sort searches the unsorted part to insert the element at right position whereas selection sort finds the minimum element from the unsorted part
Score: 1.0

Student answer: In linear searching the array or  vector is traversed using a loop in which each element of the array is at least visited one time until the loop ends. It's complexity is of O(n) where n is the number of elements in the array. 
Score: 2.0

Student answer: In insertion sort a sorted_array is maintained and elements are inserted in such a way where we have to find the min elem (for index 0) and then insert the next greater or equal element than the previous n-1 element in the sorted_array for subsequent indices. In selection sort the elements are swapped in-place until the array is sorted. 
Score: 1.0

Student answer: Selection sort has a time complexity of O(n^2) in all cases.\nInsertion sort has a time complexity of O(n^2)
Score: 1.0

Student answer: In selection sort, we take the first element as minimum element, then we find the minimum element from the remaining array using a for loop and then compare both elements and place them accordingly.\n\nIn insertion sort, we bring the smallest element from the array and insert it in it's correct position.
Score: 1.0

Student answer: selections sort is basically sorting elements by checking all elements. Insertion  sort gives the right position of the  maximum element and then works on the rest of the array.
Score: 1.0

Student answer: In insertion sort, a element is inserted at its correct position, while in selection sort, an element is selected for its correct position. 
Score: 1.0

Student answer: push, pop (it is basically operation \
Score: 1.0

Student answer: The insertion sort inserts the values in an already sorted structure to sort a set of values.  The selection sort finds the minimum number from the structure and sort it in some order.
Score: 2.0
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: in insertion sort an object is take and taken into the list so that the list remain sorted while in selection sort list is sorted according to places like at 0 for index for an array the smallest element is searched through various comparisons using for loop and swapped at 0th index with index at which it was present then same process will happen for 1st index and second smallest value is placed at it and process continues till all objects are in their places(basically end of the list or array) and list or array is sorted.
Score: 1.0

Student answer: insertion sort take O(n^2) time while selection sort take O(n) time
Score: 2.0

Student answer: Insertion sort and selection sorts both are sorting algo which have O(n^2) time complexity but there working is different.
Score: 1.0

Student answer: Linear Searching is the algorithm used to seach the target element by visiting every element in the given array.\nTime Complexity- O(n)
Score: 1.0

Student answer: insertion sort works like inserting the element one by one in array or string or stack or queue and then sorting according but it is not in case of selection sort , in selection sort we first sort elements according to requirement and then select only require elements means selecting elements according require , by doing this we reduce the time complexity to some extend 
Score: 2.0

Student answer: selection sort selects the element and takes it as the max/min  and then moves to the next element and compares it top the previous \nmax/min and places it, it selects every element and picks them up and puts them in the order like this. Where as insertion sort uses\nmore time than selection sort in particular cases and it inputs the elements as min\\max.
Score: 1.0

Student answer: In insertion sort we keep inserting an element into the sorted part of the array but in selection sort we select an element and then put it at its correct place in the array.
Score: 2.0

Student answer: in insertion sort we check for each element in the array and insert the element if the element is greater then its preceding element  and in selection sort
Score: 1.0

Student answer: In selection sort the array is divide to into two parts one is from 0 to i and other is from i to j . In this we assume that the array 0 to i is sorted in desired manner and we increase the i and thus sorts the whole array
Score: 2.0
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: In selection sort, we select the smallest element from the array and put it in the first index of the array and then find the second smallest element and so on.\nin insertion sort, we first sort the subarray containing first and second array ,and when that is sorted we insert the third element in the position in which the subarray containing first ,second, third element is sorted and so on.
Score: 1.0

Student answer: in insertion sort each and every element in unsorted portion of the array is compared with each and every element in sorted portion of the array and then swapping takes place whereas in selection sort we traverse an array the number of elements present in the array times and then minimum element is found out in each traversal and swapping takes place
Score: 1.0

Student answer:  or -1 is displayed which brings its worst case complexity of n.
Score: 2.0

Student answer: in insertion sort first the position is identified where element is to be inserted and then sorted comparing with next element\nin selection sort the initial element is separated and rest of the elements are compared and so on
Score: 2.0

Student answer: in insertion sort we divide array into two parts , 1st element and 2nd to last element in second  , we one by one traversse \n 
Score: 2.0

Student answer: Insertion sort is like sorting a deck of cards we are holding in our hand. We start with the first element and assume that it is sorted and then we start putting all the other elements in the correct places in the sorted array. By the time we reach the end of our array we have a sorted array. \n\nSelection sort woks on the principle of finding the smallest or largest element in the array and then putting it at the starting or end respectively. \n\n
Score: 1.0

Student answer: The insertion sort inserts the values in a presorted file to sort a set of values.On the other hand, selection sort finds the minimum number from the list and sort it in some order.
Score: 1.0

Student answer: In insertion sort ,we simple the first element of the data structure to be sorted and we start our sorting from the second element by comparing it with the first while in selection sort we select the first element and compare it with coming elements and do the swaps as per our need.
Score: 2.0

Student answer: In Insertion sort we first sort first two elements and then place or insert the next element in that sorted part at the correct place until the every elements are sorted.\n\nIn selection sort we select the first  element and compare it with all the elements and find min and place it in the beginning and then we select another are do the same until the last element has selected and placed.
Score: 2.0