The efficiency of the Insertion Sort is O(N2) where N is the size of the list being sorted.Group of answer choicesTrueFalse

The time complexity of inserting an element at the beginning of a linked list is:Group of answer choicesO(n log n)O(n)O(1)O(log n)

Execution of insertion sort requires time that grows as the square of the input size. Suppose that an array of 6,000 elements can be sorted with insertion sort in 6 seconds. From that knowledge, we can estimate that:Group of answer choicesSorting an array of 18,000 elements with insertion sort will take around 54 secondsSorting an array of 12,000 elements with insertion sort will take around 12 secondsSorting an array of 12,000 elements with insertion sort will take around 15 secondsSorting an array of 2,000 elements with insertion sort will take around 1 secondSorting an array of 2,000 elements with insertion sort will take around 2 seconds

When maintaining a sorted list using a binary search tree, the search operation computing time is O(1), whereas the insertion operation takes O(log2N) time.Group of answer choicesTrueFalse

The efficiency of the Merge Sort is O(Nlog2N), where N is the size of the list being sorted.Group of answer choicesTrueFalse

Which of the following sorting algorithm has the running time that is least dependant on the initial ordering of the input? Group of answer choices Selection sort Quick sort Merge sort Insertion sort