[Solved] 1 N 32 Worst Case Merge Sort Would Expected Perform Many Comparisons 32 2 1024 129 C 320 D Q37273524

Please explain how number 1,2,3,4 got their answer. Will thumbsup!

1. For n 32, in the worst case Merge Sort would be expected to perform how many comparisons? (a) (32)2 1024 129 (c) 320 (d) 64 2. For n 32, in the worst case Quicksort would be expected to perform how many comparisons? (a) (32)2 -1024 (b) 160 496 (d) 64 3. For n 32, in the best case Merge Sort would be expected to perform how many comparisons? (a) (32)2 1024 (b) 129 (c) 160 80 4. When the array is already in sorted order, (a) Quicksort is to be preferred over Merge Sort because Quicksort is an “in place” sort requiring no extra memory. (b) It doesn’t matter, since both will have complexity functions in (nlgn) (c) Quicksort is to be preferred over Merge Sort because Quicksort always runs in time complexity (nlgn) d) Merge Sort is to be preferred over Quicksort because Merge Sort always runs in time complexity (nlgn) Show transcribed image text 1. For n 32, in the worst case Merge Sort would be expected to perform how many comparisons? (a) (32)2 1024 129 (c) 320 (d) 64 2. For n 32, in the worst case Quicksort would be expected to perform how many comparisons? (a) (32)2 -1024 (b) 160 496 (d) 64 3. For n 32, in the best case Merge Sort would be expected to perform how many comparisons? (a) (32)2 1024 (b) 129 (c) 160 80 4. When the array is already in sorted order, (a) Quicksort is to be preferred over Merge Sort because Quicksort is an “in place” sort requiring no extra memory. (b) It doesn’t matter, since both will have complexity functions in (nlgn) (c) Quicksort is to be preferred over Merge Sort because Quicksort always runs in time complexity (nlgn) d) Merge Sort is to be preferred over Quicksort because Merge Sort always runs in time complexity (nlgn)

Expert Answer

---

Answer to 1. For n 32, in the worst case Merge Sort would be expected to perform how many comparisons? (a) (32)2 1024 129 (c) 320 … . . .