Between the two sorting algorithms, which does not have a worst-case scenario? [Select] What is the running time for quick sorting when it is in the worst-case scenario? [Select] [Select] log n nlog n n^2

For each question, an algorithm will be described that operates on N elements, and your answer should include: (a) a big-O expression that describes the total number of operations in the worst case (for ex- ample, O(N³)) (b) a description of how to achieve the same effect as the algorithm described, but achieved with a better big-O time bound (for example, "use mergesort instead of insertion sort") (c) the big-O time bound for your improved approach. Your improved algorithm does not need to be provably the best possible, but it should have a different and better big-O bound. (It may not be as simple as substituting one named algorithm for another; consider what is redundant about the work done by the existing algorithm.) You don't need to use pseudocode to describe your algorithms - the style used in the problem descriptions is also sufficient for your solutions. You can use pseudocode if you like. Do not write real code. If you wish to use an algorithm described in class, you can name…

Please justify your answer: Some sorting algorithms require extra space, apart from the space needed for the original  array that needs to be sorted. Which one of the following statements on the space usage of  sorting algorithms is correct?  a.)  A Heapsort for sorting an array of size N requires an amount of extra space proportional  to N.   b.)  Insertion Sort for sorting an array of size N requires an amount of extra space  proportional to N.   c.)  Merge sort for sorting an array of size N requires an amount of extra space proportional  to N.   d.) Quicksort for sorting an array of size N requires an amount of extra space proportional  to N.   e.) None of the above

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]