Sort [Problem Description] Realize direct insertion sort, half insertion sort, bubble sort, quick sort, select sort, heap sort and merge sort. [Basic Requirements] 1) Raw data is generated randomly. 2) For different problem size, output the number of comparisons and moves required by various sorting algorithms 3) When the program is running, input the problem size from the keyboard, the source data is randomly generated by the system, and then output the comparison times and movement times required by various sorting algorithms under this problem scale. Please do it according to the requirements and don’t send me other student answered questions please please please and it should be in C++

Sort [Problem Description] Realize direct insertion sort, half insertion sort, bubble sort, quick sort, select sort, heap sort and merge sort. [Basic Requirements] 1) Raw data is generated randomly. 2) For different problem size, output the number of comparisons and moves required by various sorting algorithms 3) When the program is running, input the problem size from the keyboard, the source data is randomly generated by the system, and then output the comparison times and movement times required by various sorting algorithms under this problem scale. Please do it according to the requirements and don’t send me other student answered questions please please please and it should be in C++

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter6: Modularity Using Functions

Section6.2: Returning A Single Value

Problem 11E: (Numerical) a. The following is an extremely useful programming algorithm for rounding a real number...

See similar textbooks

Similar questions

Sort [Problem Description] Realize direct insertion sort, half insertion sort, bubble sort, quick sort, select sort, heap sort and merge sort. [Basic Requirements] Raw data is generated randomly. For different problem size, output the number of comparisons and moves required by various sorting algorithms When the program is running, input the problem size from the keyboard, the source data is randomly generated by the system, and then output the comparison times and movement times required by various sorting algorithms under this problem scale. do the code in c++ please.
Complete C++ source code for Write a complete C++ program to help the manufacturer determine the greatest profit obtain from making tables and chairs with a given number of M type A and N type B wood blocks. • The program should prompt the user to input M and N.• Then tabulates all the combinations of tables and chairs possibly made, and calculates the profit obtain using array. • The program should also identify the greatest profit and make a concluding remark.• The program should be written in modular form with the main() function calling other functions. If arrays are involved in the function, the arrays should be passed into the function as parameters.• Lastly, display the output to an external .txt file.
Complete C++ source code for Write a complete C++ program to help the manufacturer determine the greatest profit obtainfrom making tables and chairs with a given number of M type A and N type B wood blocks.• The program should prompt the user to input M and N.• Then tabulates all the combinations of tables and chairs possibly made, and calculatesthe profit obtain using array.• The program should also identify the greatest profit and make a concluding remark.• The program should be written in modular form with the main() function calling otherfunctions. If arrays are involved in the function, the arrays should be passed into thefunction as parameters.• Lastly, display the output to an external .txt file.
Please note global variables are not allowed to use in this assignment except of global constants. Find Median. In statistics, the median of a set of values is the value that lies in the middle when the values are arranged in sorted order. If the set has an even number of values, then the median is taken to be the average of the two middle values. Write a C++ program that determines the median of a sorted array. In the main function, Declare and initialize two arrays. One array must contain an even number of values, for example {91, 71, 67, 78, 76, 82, 100, 89}. The other array must contain an odd number of values, for example {76, 71, 78, 67, 82}. Call a function named sortArray to sort the values in each array in ascending order. should take an array of numbers and an integer indicating the size of the array as the arguments, and sort the array in ascending order. This function does not return any value. Call another function named findMedian to find the median of the values in…
(b) Good Programming practices help in improving programs readability and understandability both for a programmer and for a general user. What changes would you make in the following program, written by a beginner, keeping in view the good programming practices. You are also required to write the output of the program if a user wants to find factorial of number 6. Note: The Program finds/calculates factorial of a number using a user defined recursive function. #include<iostream> using namespace std; int f(int n); int main() {int n; cout << "Enter: "; cin >> n; cout << "Answer = " <<factorial(n); return 0; } int f(int n) { if(n > 1)return n * f(n - 1); else return 1; }
Perform matrix multiplication of 2D array. The program should meet the matrix multiplication rule i.e. number of columns of first matrix should be equal to the number of rows of second matrix. The input of two matrices A and B is given by user. Use function approach to handle array multiplication.
C Program - Array Positive and Negative Rotations Make a program that creates two arrays by asking the size n of the arrays (the two arrays have the same size) and their corresponding n integer inputs. Example: Input size of the arrays: 5 Array 1 elements: 1 2 3 4 5 Array 2 elements: 3 4 5 1 2 You are tasked to determine the minimum # of positive and negative rotations of Array 2 to become Array 1. A positive rotation is a rotation to the right while a negative rotation is a rotation to the left. Given the example elements of Array 1 and Array 2 above, here's a sample computation: Right Rotations 3 4 5 1 2 -> 2 3 4 5 1 -> 1 2 3 4 5 = 2 rotations Left Rotations 3 4 5 1 2 -> 4 5 1 2 3 -> 5 1 2 3 4 -> 1 2 3 4 5 = -3 rotations Output the number with the highest absolute value (but still display the negative sign, if the selected value is the value of the left rotations which is negative). If the two values are equal, output the negative value and if it's impossible…
(b) Good Programming practices help in improving programs readabilityand understandability both for a programmer and for a general user.What changes would you make in the following program, written by a beginner, keeping in view the good programming practices.You are also required to write the output of the program if a user wants to find factorial of number 6. Note: The Program finds/calculates factorial of a number using a user defined recursive function. #include<iostream> using namespace std; int f(int n); int main() { int n;cout << "Enter: ";cin >> n;cout << "Answer = " <<factorial(n);return 0;}int f(int n){if(n > 1)return n * f(n - 1);elsereturn 1;}
Problem B Musical Key ConversionThe chromatic scale is a 12-note scale in music in which all notes are evenly spaced: that is, the ratio of the frequency between any two consecutive notes is constant. The notes are typically labeled in the following sequence: A, A#, B, C, C#, D, D#, E, F, F#, G, G# After G#, the labels loop back and start over with A (one octave higher). To convert between musical keys, you can shift all notes in a piece of music a constant number of steps along the scale above. For example, the sequence of notes E, E, F, G, G, F, E, D, C, C, D, E, E, D, D can be converted to another musical key by shifting everything up three steps: E, E, F, G, G, F, E, D, C, C, D, E, E, D, D G, G, G#, A#, A#, G#, G, F, D#, D#, F, G, G, F, F Notice that G was converted to A#, since going three steps up required us to loop off of the top of the scale back to the bottom: G -> G# -> A -> A#. Technically we should note that this would be A# of the next octave up, but we’ll…
Problem B. Musical Key ConversionThe chromatic scale is a 12-note scale in music in which all notes are evenly spaced: that is, the ratio of the frequency between any two consecutive notes is constant. The notes are typically labeled in the following sequence: A, A#, B, C, C#, D, D#, E, F, F#, G, G# After G#, the labels loop back and start over with A (one octave higher). To convert between musical keys, you can shift all notes in a piece of music a constant number of steps along the scale above. For example, the sequence of notes E, E, F, G, G, F, E, D, C, C, D, E, E, D, D can be converted to another musical key by shifting everything up three steps: E, E, F, G, G, F, E, D, C, C, D, E, E, D, D G, G, G#, A#, A#, G#, G, F, D#, D#, F, G, G, F, F Notice that G was converted to A#, since going three steps up required us to loop off of the top of the scale back to the bottom: G -> G# -> A -> A#. Technically we should note that this would be A# of the next octave up, but we’ll…
answer this using c++ Part 1: Write a function that receives, as arguments, a pointer to a double array, as well as the number of elements in the array (int). The function must use pointer operations (no block notation such as arr[i]) and calculate the standard deviation of the elements in the array. The function returns the standard deviation to the calling statement. Due to possible rounding or floating-point arithmetic errors, round the result to 4 decimal places. Use the formula below. Each summation can be done with a for-loop. To calculate the square root you may use the <math.h> header file. You may use the following code: float data[] = {11.2, 2.4, 3.13, 16.4, 5.8, 9.22, 4.9, 10.5, 6.5, 2.99}; int N = sizeof(data) / sizeof(float); Part 2: Write a function that receives, as arguments, a pointer to a double array, as well as the number of elements in the array (int). The function must use pointer operations (no block notation such as arr[i]) and must display each…
Task using C language One common way of verifying if the data integrity of a file was preserved during a copy or transmission is to verify if the checksum matches. The checksum is a small piece of data computed from the original data. Your task is to compute a recursive function that maps an integer into a single digit to be used as checksum. Given an input integer in the range from 0 to 1012, the checksum is the sum of the digits of the input number. While the resulting sum has multiple digits, the checksum will be the sum of its digits instead. For instance: if the input is 34, the checksum is 7 (3+4); if the input is 99, the sum of its digits is 18 (9+9), so the checksum is 9 (1+8); if the input is 99999999999, the sum of its digits is 99 (9+9+9+9+9+9+9+9+9+9+9), whose sum of digits is 18 (9+9), so the checksum is 9 (1+8). Requirements Follow the format of the examples below. Make sure your variables and parameters have the correct data types. You must implement a recursive…