Compare the sorting durations of the insertion sort and QuickSort using a small collection (less than 20 elements). What is the time difference? Can you elaborate on why?

What arrangement of keys is a best case for Bubble Sort, that is, for what input does it do the fewest comparisons? How many comparisons does it do in the best case?

The interchange implementation was supposed to be better than the transpose implementation as it implements the same algorithm without the need of copying the 640,000 elements. However, it is not. How do you explain this inconsistency?

Compare the performance of selection shell sort, bubble sort and bubble sort2 interms of time and space complexity?

What is the auxiliary space complexity and average time complexity of randomized rapid sort?

Create and test assumptions regarding the running times of insertion sort and selection sort for arrays with just two key values, assuming the values are equally likely to occur.

Design a database for an airline. The database must keep track of customers and their reservations, flights and their status, seat assignments on individual flights, and the schedule and routing of future flights. Your design should include an E-R diagram, a set of relational schemas, and a list of constraints, including primary-key and foreign-key constraints.

Compare the sorting times of the insertion sort with QuickSort using a small array (less than 20). What is the time difference? Could you explain why?