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

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

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

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

Student answer: Best case-1<br>Worst Case-N
Score (0-5): 2

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

Student answer: O(n)
Score (0-5): 3.5

Student answer: Best case is all elements sorted.<br>n-1.
Score (0-5): 4

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

Student answer: 1 operation. the best case scenario s where it is already sorted and does one comparision.
Score (0-5): 3

Student answer: n operations, where n is the number of items.
Score (0-5): 4

Student answer: n-1
Score (0-5): 3.5

Student answer: O(n), the list is already sorted.
Score (0-5): 4.5

Student answer: Insertion sort will take n-1 operations if the array is in reverse order.
Score (0-5): 4

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

Student answer: 1 where there is a list of two ints and only one must be moved.
Score (0-5): 2.5

Student answer: Best case is N, while the worst case is N factorial.
Score (0-5): 3

Student answer: n-1<br>The best case is when the array is already sorted.
Score (0-5): 4.5

Student answer: worst case its = O(n) time<br>best case its = O(n^2) time
Score (0-5): 3

Student answer: O(n)
Score (0-5): 3.5

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

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

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

Student answer: theta(n)<br>the best case senario is that everything is already sorted
Score (0-5): 4.5

Student answer: n operations<br><br>The best case scenario is when all the numbers are in increasing order.
Score (0-5): 5

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

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

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