What are the best-case and worst-case running time of Insertion Sort, Merge Sort, and Quicksort? Which sorting algorithm is efficient and why?

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

Why might you combine a sorting algorithm with another algorithm?Write at least two paragraphs explaining and answering the above- evaluate the strengths, weaknesses, other possible applications that can be made.

Conceptual Question:   Can you explain the following Sorting Algorithms and provide an example of how they work and function? RadixBucketHeapMerge   What are their complexities and how fast are they?

What are some common sorting algorithms, and what is the time complexity of each?

Give an example of a real-life scenario where one sorting algorithm outperforms the other

Know the big O notation for linear search, binary search, selection sort, and merge sort. Be able to rank these algorithms in terms of complexity.

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]

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

Consider sorting a list of items that are in reverse sorted order. If you were forced to pick between the three iterative sorting algorithms (bubble sort, selection sort, or insertion sort) to work through this set and place it into normal (ascending) sorted order, which would you pick and why?