A) What are the Big-O *average* complexities of these sorting algorithms for N elements? Algorithm Average complexity Insertion Sort Heap sort Merge Sort Radix sort Quicksort Consider the list {10, 1, 8, 2, 4, 6, 4, 9, 12} for parts B & C: B) Using the QuickSort algorithm where we used the median of three rule, what will the pivot value be for the first iteration? C) Circle the sorting algorithm that you’d pick to use in this situation: You are running a library catalog. You know that the books in your collectionare almost in sorted ascending order by title, with the exception of one bookwhich is in the wrong place. You want the catalog to be completely sorted in ascending order. You do not need to explain your answer: 1. Merge Sort 2. Insertion Sort 3. Radix Sort 4. Heap Sort 5. Counting Sort

A) What are the Big-O average complexities of these sorting algorithms for N elements? Algorithm Average complexity Insertion Sort Heap sort Merge Sort Radix sort Quicksort Consider the list {10, 1, 8, 2, 4, 6, 4, 9, 12} for parts B & C: B) Using the QuickSort algorithm where we used the median of three rule, what will the pivot value be for the first iteration? C) Circle the sorting algorithm that you’d pick to use in this situation: You are running a library catalog. You know that the books in your collectionare almost in sorted ascending order by title, with the exception of one bookwhich is in the wrong place. You want the catalog to be completely sorted in ascending order. You do not need to explain your answer: 1. Merge Sort 2. Insertion Sort 3. Radix Sort 4. Heap Sort 5. Counting Sort

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter16: Searching, Sorting And Vector Type

Section: Chapter Questions

Problem 16SA

See similar textbooks

Similar questions

1. Which of the following statements are correct? (Select all that applies.) Group of answer choices a. Merge-sort and quick-sort algorithms are based on the divide-and-conquer paradigm. b. The time complexity of selection-sort algorithm is O(n^2). c. The time complexity of insertion-sort algorithm is O(n^2). d. The time complexity of heap-sort and merge sort algorithms is O(nlogn). e. running time of quick-sort algorithm is O(nlogn). 2. The key process in quick-sort is the partition. The target of partitions is, given an array and an element x of an array as the pivot, put x at its correct position in a sorted array and put all smaller elements (smaller than x) before x, and put all greater elements (greater than x) after x. Group of answer choices a. True b. False
1. Which of the following statements are correct? (Select all that applies.) Group of answer choices Merge-sort and QuickSort algorithms use the divide and conquer method. Searches take O(log n) time using binary search The total running time of merge-sort is O(nlogn). 2. Which of the following is both in-place sorting and O(nlogn) running time? Group of answer choices Selection-sort Insertion-sort Heap sort 3. Which of the following statements are correct? (Select all that applies.) Group of answer choices "ABCDEFG" and "XZACKDFWGH" have "ACDG" as a longest common subsequence. If X is of length n, then it has 2^n subsequences. There is a dynamic programming approach to the longest common subsequence problem. 4. What is the correct syntax to create a NumPy array? Group of answer choices np.object([1, 2, 3]) np.createArray([1, 2, 3]) np.array([1, 2, 3]) 5. What is the correct Pandas function for loading CSV files into a DataFrame? Group of answer choices…
Q: Suppose you are given an array A of n elements. Your task is to sort n numbers stored in array A by reading the first element of A and placing it on its original position (position after sorting). Then read the second element of A, and place it on its original position. Continue in this manner for the first n-1 elements of A. What type of sorting is this? Write the algorithm and also mention the name of this sorting algorithm. What loop invariant does this algorithm maintain? Give the best-case and worst-case running times of this sorting algorithm.
Anwer the three questions 1. Which of the following statements are correct? (Select all that applies.) Group of answer choices a. Merge-sort and quick-sort algorithms are based on the divide-and-conquer paradigm. b. The time complexity of selection-sort algorithm is O(n^2). c. The time complexity of insertion-sort algorithm is O(n^2). d. The time complexity of heap-sort and merge sort algorithms is O(nlogn). e. Expected running time of quick-sort algorithm is O(nlogn). 2. The key process in quick-sort is the partition. The target of partitions is, given an array and an element x of an array as the pivot, put x at its correct position in a sorted array and put all smaller elements (smaller than x) before x, and put all greater elements (greater than x) after x. Group of answer choices a. True b. False 3. Which one is an example of not-in-place sorting? Group of answer choices a. Selection-sort b. Insertion-sort c. Merge-sort d. Quick-sort
Present an example of walking through the merge sort or the quick sort algorithm (your choice) This is an algorithm tracing activity, not a coding exercise. Do not post any code or code output. Post the following for merge sort: Start with an unordered list of at least NINE elements. List all the recursive calls that would be made to sort the list, going forward. Show which pair of sub-lists will be merged each time, going back. Show the ordering of the sub-list after each recursive call returns. Post the following for quick sort: Start with an unordered list of at least NINE elements. State what element will be the pivot value (use only low index or median-of-three). List all the recursive calls that would be made to sort the list. Show the ordering of the sub-list after each recursive call returns.
Now implement Merge Sort, Heap Sort, and Quick Sort in C++ and perform the followingexperiment:1. Generate an Array A of 108 random numbers. Make its copies B and C. Sort A usingMerge Sort, B using Heap Sort, and C using Quick Sort.2. During the sorting process, count the total number of comparisons between array elements made by each algorithm. You may do this by using a global less-than-or-equal-to function to compare numbers, which increments a count variable each time it is called.3. Repeat this process 5 times to compute the average number of comparisons made byeach algorithm.4. Present these average counts in a table. These counts give you an indication of how thedifferent algorithms compare asymptotically (in big-O terms) for a large value of n.(b) Now compare the same algorithms in terms of practical time, i.e. the actual running time.Simply, repeat the previous example but use the chrono library to compute the actual timestaken by each algorithm, and report the average value…
Q1)Suppose you are given an array A of n elements. Your task is to sort n numbers stored in array A by reading the first element of A and placing it on its original position (position after sorting). Then read the second element of A, and place it on its original position. Continue in this manner for the first n-1 elements of A. What type of sorting is this? Write the algorithm and also mention the name of this sorting algorithm. What loop invariant does this algorithm maintain? Give the best-case and worst-case running times of this sorting algorithm. Q2)Consider an array consisting of the following sequence: 1, 4, 9, 16, 25, 49, …, n Suppose a number in the sequence is missing. Write the mathematical process to find the missing number, i.e. some equation. What is the time complexity of finding the missing number in the sequence? Q3)Sort the text “SARHAD UNIVERSITY” in ascending order using the insertion sort algorithm. Discuss also the best, worst and average case complexity of the…
Consider a situation where swap operation is very costly. Which of the following sorting algorithms should be preferred so that the number of swap operations are minimized in general? (a) Insertion Sort (b) Quick Sort (c) Heap Sort (d) Selection Sort (e) Merge Sort
This question concerns the following sorting algorithm (attachment). (b) Consider the operation of SORT on a list of length N. How many comparisons in line 4 take place when i = 1 and when i = N-1? (c) How many comparisons take place in total? Show your working. You may use the result 1+2+...+n=n[(n+1)/2] (d) Based on the analysis above, or otherwise, what is the worst, best and average- case time complexity of SORT? Explain your answer.
USE JAVA The merge sort is a recursive algorithm that can be used to sort an array by first sorting smaller versions of an initial list of object. In this discussion, provide a simple of code sample of Merge sort and describe the benefits of using the merge sort. What are the key steps that must be taken to ensure an efficient sorting of objects? In your answer, specifically think of and give a real-life scenario where Merge sort may be used Merge sort may be a better fit than Quick and Radix sorts
What is the time complexity of deleting an element from a sorted array? Does it have better time complexity than deleting a node from an unsorted array? Why? What is the time complexity of append operation of an unsorted array of size n? why? What is the time complexity (in big-O notation) of binary search in a sorted array containing m (m >0) numbers? Why is the insertion not supported for unsorted array? What are the fundamental operations of an unsorted array?
Consider an unsorted array of elements {25, 17, 36, 2, 3, 100, 1, 19, 7}:i) Show how to get the first four sorted numbers when applying Selection sort and Insertion sort.ii) Show how to get the first two partitions for the above array when Quicksort is applied.iii) Show the steps to search for 25 in the above sequence using binary search algorithm.iv) Write a C++ program to search for 17 in the above sequence using linear searching algorithm.