2. Since the worst-case running time of quick sort is O(n2), we want to improve the algorithm by setting a depth limit of the partition tree. Starting with the classic recursive quick sort algorithm, once it reaches the depth limit, the existing partitions are sorted by heap sort or merge sort. Explain why this would improve the classic quick sort algorithm. What would be a reasonable depth limit

Why is it uncommon for users to perform searches directly in database tables? a.)users are discouraged from interacting directly with tables because they might confuse tables with spreadsheets. b.) users are discouraged from interacting directly with tables because this may result in unintended changes to source data. c.)users do not have the technical skills required to perform searches directly in database tables. d.)users do not have the permissions required to perform searches directly in database tables.