Task C++

Hello people I have only a little problem with this task.

I think I have solved the rask right but I am not sure perhaps all experts here can help me:

Task:

It is a function to be created, which by an array a with the method "Sort
Mix "ascending.
Function using recursion: sortMerge (n, a)
Here the procedure is as follows:
If an item contains a maximum of one is finished (already sorted)
otherwise
Create 2 matching arrays b and c
Train 2 halves of the array and save it in a new array b and c
Note:
a new array of names h and m elements can be generated as follows:
double * h = new double [m];
The type is double; other similar types;
m is an expression / a variable of type int
With delete [] h, you can delete it again.
Sort b and c with SortMerge
Mix b and c with the function of internship 9 and store the result in a
Delete b and c.

Proceed to creating a suitable program to test the function.
Example of a step in the algorithm:
Sort is a: 11 2 9 7 8 3 2 with 7 elements.
In 2 parts disassemble and store in b and c: b: 11 2 9 c: 7 8 3 2
The 2 parts with SortMerge by: b: 2 9 11 c: 2 3 7 8
The 2 parts to a mix a: 2 2 3 7 8 9 11

My Programm:

 ``1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859`` ``````#include using namespace std; int a[] = {11, 2, 9, 7, 8, 3, 2}; int n = 7; void merge(int *a,int p,int *b,int q, int *c,int n); void sortMerge(int n, int *a) { if (n>1) { int *b = new int[n/2]; int *c = new int[(n + 1)/2]; int i; for(i=0; i < n/2; i++) { b[i] = a[i]; } for(i=n/2; i < n; i++) { c[i - n/2] = a[i]; } sortMerge(n/2, b); sortMerge(n-n/2, c); merge(b,n/2,c,n-n/2,a,n); delete[] b; delete[] c; } } void merge(int *b,int p,int *c,int q, int *a,int n) { int i=0,j=0,k=0; while(i

Is this programm so ok?

And can please someone tell me how I can modify the program so that when I run the programm I can test the function?

For example when I run I have to type numbers and it shows the numbers sortet like its written in the task?
Can somebody please help me?
Is here a good programmer or some experts who can help me?
 ``12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091`` ``````#include using namespace std; void merge(int *a,int p,int *b,int q, int *c,int n); void sortMerge(int n, int *a); void sortMerge(int n, int *a) { if (n>1) { int *b = new int[n/2]; int *c = new int[(n + 1)/2]; int i; for(i=0; i < n/2; i++) { b[i] = a[i]; } for(i=n/2; i < n; i++) { c[i - n/2] = a[i]; } sortMerge(n/2, b); sortMerge(n-n/2, c); merge(b,n/2,c,n-n/2,a,n); delete[] b; delete[] c; } } void merge(int *b,int p,int *c,int q, int *a,int n) { int i=0,j=0,k=0; while(i

>n; int a[n]; for(i=0;i>a[i]; } sortMerge(n, a); for (i=0; i

You need double, so change all the integers to doubles. (When I tried changing the ints to doubles, I got a whole lot of errors (more errors coming from the ones I fixed).) Good luck, hope this helps.
This was also my problem , that^s why I was asking.

Perhaaps somebody else can help me.

Otherwise I will let the programm how it is.
Hi there,

If you get compiler errors, please include them in the topic, that makes it easier for us to verify what is wrong with the program.

All the best,
NwN
Do you have an idea how I can change my Programm . Perhaps you can Post another Code.
Because the task is or so already solved.
 ``12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091`` ``````#include using namespace std; void merge(double *b,int p,double *c,int q, double *a,int n); void sortMerge(int n, double *a); void sortMerge(int n, double *a) { if (n>1) { double *b = new double[n/2]; double *c = new double[(n + 1)/2]; int i; for(i=0; i < n/2; i++) { b[i] = a[i]; } for(i=n/2; i < n; i++) { c[i - n/2] = a[i]; } sortMerge(n/2, b); sortMerge(n-n/2, c); merge(b,n/2,c,n-n/2,a,n); delete[] b; delete[] c; } } void merge(double *b,int p,double *c,int q,double *a,int n) { int i=0,j=0,k=0; while(i

>n; double a[n]; for(i=0;i>a[i]; } sortMerge(n, a); for (i=0; i

OMG I FIXED IT!!!!!!!!!!!!!!!!!!!!!!!!! IT WORKS! YOUR'E WELCOME!!! ;D ;D :D :) ;)
Topic archived. No new replies allowed.