c++ how do I create a program which uses merge sort to sort the following data: 14, 23, 41, 52, 34, 12, 19, 65 use the following merge sort algorithm MergeSort (Array, size) { Allocate an array called leftArray of size1 = size / 2 ; Allocate an array called rightArray of size2 = size - size1 Copy elements from Array into leftArray Copy element from Array into rightArray Recursively apply the merge sort to leftArray. Recursively apply the merge sort to rightArray. Combine the one-element arrays into one single array. }

c++ how do I create a program which uses merge sort to sort the following data: 14, 23, 41, 52, 34, 12, 19, 65 use the following merge sort algorithm MergeSort (Array, size) { Allocate an array called leftArray of size1 = size / 2 ; Allocate an array called rightArray of size2 = size - size1 Copy elements from Array into leftArray Copy element from Array into rightArray Recursively apply the merge sort to leftArray. Recursively apply the merge sort to rightArray. Combine the one-element arrays into one single array. }

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter12: Points, Classes, Virtual Functions And Abstract Classes

Section: Chapter Questions

Problem 29SA

See similar textbooks

Related questions

Q: Recursivle function to sort two arrays into one in cpp

A: Firstly we have to sort the two arrays, then we have to compare the elements of both array, then the…

Q: Complete a Selection sort on the following values: 2, 22, 12, 21, 3, 1 Each row is one full…

A: Selection sort is a sorting algorithm that selects the smallest element from an unsorted list in…

Q: c++ how do I create a program which uses quick sort to sort the following data: 10, 17, 9, 52, 34,…

A: here is your code

Q: Code in Python Q) Write a function to sort given array using Selection sort algorithm and returns…

A: SELECTION SORT is a comparison sorting algorithm that is used to sort a random list of items in…

Q: Insertion sort is a simple sorting algorithm that builds the final sorted array one item at a time.…

A: Following given algorithm, 1.First implement binary search as helper method for algorithm 2.second,…

Q: in c++ how would i sort an array in ascending order by the last digit of the element for example…

A: Write a C++ Program which can sort an array elements in ascending order by the last digit of the…

Q: AIM: Write a program to do Binary Search using a given Search Key in a Sorted Linear Array 'A' which…

A: CODE: #include<iostream> using namespace std; int BinarySearch(int A[],int N,int Key){…

Q: 6 - Merge sorted arrays Program a method merge_sorted(a,b) that when given two sorted arrays a and…

A: #include <iostream> using namespace std; void merge_sorted(int arr1[], int x, int arr2[], int…

Q: In an array-based implementation of a dictionary, using one array to store the search keys and a…

A: We are asked a question based on dictionary, where we are talking about arrays implementation of the…

Q: How many comparsions would be needed for merge sort algorithm for these 3 types of arrays and all of…

A: The number of comparisons is 6*log26 - 5

Q: The provided Search algorithm is use to find the specified element in the given array, perform dry…

A: The given code is of binary search algorithm. The complexity of binary search algorithm is O(log2…

Q: Consider the following array of int values. [17, 11, 6, 22, -3, 8, 4, 22, 2, 35, -4, 10] Write the…

A: Selection sort: Elements in array: [17, 11, 6, 22, -3, 8, 4, 22, 2, 35, -4, 10] Pass 1: Find the…

Q: 2 3 7 1 7 9 4 6. 5 | 8 1. Write down the steps of sorting the following array using Merge Sort. 2.…

A: As per our guidelines, we are allowed to answer only one question. Kindly post the other question as…

Q: draw different stages of Merge Sort to sort the following array. 3 8 4 7 6 5 2 9 1

A: Given list of numbers is: 3 8 6 5 4 7 2 9 1 Merge sort is a sorting algorithm in which the…

Q: LSD Radix sort is used to sort the following list of data: [mak, kcl, pks, kih, brb, jyr, Iwk, scc,…

A: The correct answer is [ mak, scc, kcl, tea, kih, pks, brb, lwk, jyr ] Sorting is used for arranging…

Q: Given the following array: 65, 15, 129, 22, 12, 10, 239, 334, 10, 111, 180, 1, 2 What will be the…

A: For the given array 65, 15, 129, 22, 12, 10, 239, 334, 10, 111, 180, 1, 2 Provided the solution…

Q: IN PYTHON LANGUAGE Perform Quick Sort and Merge sort for any unsorted array. Step by step process…

A: Introduction Sorting: Sorting is the act of placing data in a specific order. Data (usually…

Q: Q:During each iteration of Quick Sort algorithm, the first element of array is selected as a pivot.…

A: Quick sort algorithm works on partition like merge sort and follows divide and conquer approach. It…

Q: C++ program Given arrays we need to merge all overlapping ranges array to non overlapping array that…

A: Algorithm:I defined the array inside the main function if you want you can take input from the…

Q: Array = [10, 100, 10000, 1, 100000, 1000000, 100, 1000, 10000, 10000000, 1000000000, 100000000,…

A: Here is your solution - ( HERE NO SPECIFIC LANGUAGE IS MENTIONED SO I AM USNG JAVA )

Q: Using the C language, Write a program that to perform an insertion sort for the following array.…

A: GIVEN: Using the C language, Write a program that to perform an insertion sort for the following…

Q: 3. Show the steps execution of the MERGE SORT on the following array into ascending order: U N I V E…

A: Merge sort is a sorting technique that follows the divide and conquer strategy.

Q: 23 32 45 69 72 73 89 97 Which algorithm out of the following options uses the least number of comp…

A: The answer is

Q: Sort the given array arr] = {5,8,9,1,10,3,85,74,98,14,21,16) using selection sort algorithm. IN C++

A: In selection sort algortihm we select the smallest element present in the unsorted part of the…

Q: Merge sort can be implemented using O(1) auxiliary space.

A: Standard merge sort requires O(n) space to consolidate two merge arrays. We can improve this…

Q: A merge sort is used to sort an array of 1000 test scores in descending order. Which of the…

A: Answer of the given question choice (d) is the correct answer The complete explanation is given in…

Q: 3. Using Bubble sort, sort the following values in an increasing order. 8,2,4,9,12,7,10

A: Given: 3. Sort the following items in ascending order using Bubble sort. 8,2,4,9,12,7,10

Q: replace this vector to array void merge_sort_4(vector lst,int start,int end){ if (start lst,int…

A: Below I have provided C++ Programming. Also, I have attached the screenshot of the code and output…

Question

c++

how do I create a program which uses merge sort to sort the following data: 14, 23, 41, 52, 34, 12, 19, 65

use the following merge sort algorithm

MergeSort (Array, size)

{

Allocate an array called leftArray of size1 = size / 2 ;

Allocate an array called rightArray of size2 = size - size1

Copy elements from Array into leftArray

Copy element from Array into rightArray

Recursively apply the merge sort to leftArray.

Recursively apply the merge sort to rightArray.

Combine the one-element arrays into one single array.

}

Process or set of rules that allow for the solving of specific, well-defined computational problems through a specific series of commands. This topic is fundamental in computer science, especially with regard to artificial intelligence, databases, graphics, networking, operating systems, and security.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Problem Solution:-

Program(pg1)

Program(pg2)

Program(pg3)

Program(pg4)

Output

Step by step

Solved in 6 steps with 5 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

c++ how do I create a program which uses quick sort to sort the following data: 10, 17, 9, 52, 34, 12, 44, 71 use the following quick sort algorithm QuickSort (Array, first, last) { pivot = first; partition (array with pivot at the right place); QuickSort (Array, first, pivot - 1) QuickSort (Array, pivot + 1, last) }
language is python 3
A merge sort is used to sort an array of 1000 test scores in descending order. Which of the following statements is true?a) The sort is fastest if the original test scores are sorted from smallest to largestb) The sort is fastest if the original test scores are in completely sorted order.c) The sort is fastest if the original test scores are sorted from largest to smallest.d) The sort is the same, no matter what the order of the original elements.
What array will best fit this array after four steps of the insertion sort. 5791426830 O A. [1,2,4,5,6,7,9,8,3,0] B. [1,5,7,9,4,2,6,8,3,0] O C. [1,4,5,7,9,2,6,8,3,0] O D. [5,7,9,1,4,2,6,8,3,0] Reset Selection
C programming language
How many comparsions would be needed for merge sort algorithm for these 3 types of arrays and all of them has a size of 6. Please provide a calculation. sorted array unsorted array (Answer should be in range) identical array
Q1: Apply, quick merge and buble sort on given array. Index: 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 Value: 1 8 10 14 15 11 13 18 2 4 6 5 19 3 20 Array: 18
vbdzbbbdfbdfbbdbd
In an array-based implementation of a dictionary, using one array to store the search keys and a separate array to store the corresponding values is called O O parallel arrays concurrent arrays corresponding arrays duplicate arrays
Illustrate how to do a selection sort for the below array. arr [ ] = 64 25 12 22 11
this function c++ accept vector , replace this vector to array void merge_sort_4(vector<int> lst,int start,int end){if (start < end){int quarter1 = (start + end) / 4;int quarter2 = (start + end) / 2;int quarter3 = (end - quarter1 - 1); merge_sort_4(lst, start, quarter1);merge_sort_4(lst, quarter1 + 1, quarter2);merge_sort_4(lst, quarter2 + 1, quarter3);merge_sort_4(lst, quarter3 + 1, end); merge4(lst, start, quarter1, quarter2, quarter3, end);}}void merge4(vector<int> lst,int start,int q1,int q2,int q3,int end){vector<int> first_q_list;for(int i=start;i<q1+1;i++)first_q_list.push_back(lst[i]);vector<int> sec_q_list;for(int i=q1+1;i<q2+1;i++)sec_q_list.push_back(lst[i]);vector<int> third_q_list;for(int i=q2+1;i<q3+1;i++)third_q_list.push_back(lst[i]);vector<int> last_q_list;for(int i=q1+1;i<end+1;i++)last_q_list.push_back(lst[i]);int…
Data Structure and AlgorithmPlease give direct answers