Merge Sort
1. Which of the following is not an array?
2. Which of the following is an array sorted in descending order?
3. Consider the following arrays:
A = [5, -5, 10, 1]
B = [0, 100, 1, 0]
Which of the following arrays represents the combination of the 2 arrays in a sorted order(assume ascending order)?
A = [5, -5, 10, 1]
B = [0, 100, 1, 0]
Which of the following arrays represents the combination of the 2 arrays in a sorted order(assume ascending order)?
4. When dividing an array into equal sized partitions (as closely as possible), how does the time complexity of the overall algorithm vary with the number of partitions made per step (fixed number per step)? Note that the number of partitions directly affects the size of the partitions. Greater the number of partitions, the smaller each partition will be.