9. How does the insertion sort algorithm differ in efficiency compared to the quicksort algorithm when applied to large datasets?

Is searching with pre-sorting usually worse or better than sequential search in time complexity? [Select] [Select] worse better [Select] e since we usually do more lookups after a one-time sorting? What kind of search do we apply for its efficiency? [Select] How much time does it take for the worst case when we apply a binary search? [Select]

Show all the steps of the following data set when it being sorted with Insertion sort  algorithm and calculate the performance of it. Then, show all the steps of finding the element 7 using the Binary search. 7 13 9 2 11 22

No hand written and fast answer with explanation

Is searching with pre-sorting usually worse or better than sequential search in time complexity? [Select] Which is more useful in practice since we usually do more lookups after a one-time sorting? [Select] What kind of search do we apply for its efficiency? [Select] [Select] binary search decimal search How much time does it take for the worst case whe [Select]

Answer the question using bubble sort, enhanced bubble sort (this was the version presented in lecture), selection sort, and insertion sort. Thy has data that she suspects may already be sorted. Which sorting method should she NOT use and why?

6. Below is a table that shows the timing of three different algorithms using an array of integers as input. Explain which of the algorithms is most likely the selection sort and which is the merge sort, explain in details your answer. Algorithm 1 Algorithm 2 Algorithm 3 time to process 2000 integers 0.1431 sec 0.8011 sec 0.0132 sec time to process 4000 integers 0.5722 sec 1.4300 sec 0.0304 sec time to process 8000 integers 2.2989 sec 2.4512 sec 0.0634 sec

Describe how the quantity of movements and comparisons impacts the temporal complexity of insertion sorting.

Consider a situation where swap operation is very costly. Which of the following sorting algorithms should be preferred so that the number of swap operations are minimized in general? (a) Insertion Sort (b) Quick Sort (c) Heap Sort (d) Selection Sort (e) Merge Sort

What is the time complexity (in big-O notation) of binary search in a sorted array containing m (m >0) numbers? Why is the insertion not supported for unsorted array? What are the fundamental operations of an unsorted array?