Dividing array in two new arrays

[latvian4life]

Hello world! So situation is as follows. I'm total beginner in C++ and it is first language I am learning. I have this task given:

From array A(2n) I need to get two arrays B(n) and C(n)as follows: in array A I need to find two closest numbers. Smallest I need to put in array B, but biggest into array C. I need to continue this until all elements are out of array A and into array B and C.


Ok I understand I need to sort array A and find the closest values, but I don't understand how to divide that array A into two separate arrays.

[Thomas1965]

You actually don't change array A.

Just create arrays B and C and copy the numbers from A to B and C.

[DeathLeap]

This is an example I did.

It's not that practical to be honest, I am wondering how I can make it more convenient.

#include <iostream>
using namespace std;

int main(){

	int a[4] = {1, 2, 3, 4};
	int b[2] = {};
	int c[2] = {};

	for ( int i = 0; i < a[0]; i++ ){

		b[0] = a[i];
		b[1] = a[i+1];
	}

	for (int j = a[3]; j >= a[1]; j--){

		c[0] = a[j];
		c[1] = a[j+1];
	}

	cout << b[0] << b[1] << endl;
	cout << c[0] << c[1] << endl;

	system("PAUSE");
	return 0;
}

output:

12
34

[latvian4life]

Thank you. That helps me. But I don't understand how to put it together with finding two closest values and then those values giving to array B and C.

[latvian4life]

I made this to find closest values in array. I can give the values i found to arrays B and C. I don't understand how to delete them from array A so I can find next two closest values. Can someone help.

#include <iostream>
using namespace std;




int main()
{
    const int n=7;
    int a[n] = {5,9,15,17,25,26,33};
    int starp = a[6];
    int sk1 = 0;
    int sk2 = 0;

 
    for (int i=0;i<n-1;i++)
    {
            int tempstarp = a[i+1]-a[i];

            if(tempstarp<starp)
            {
                starp=tempstarp;

                 sk1 = a[i+1];
                 sk2 = a[i];
            }
        }


    cout << sk1 << " " << sk2 << endl;
    cout << starp << endl;

}

[cire]

You could 'delete' them by moving all other elements at higher indexes to the left and decrease the number of elements in the array you're processing. Or, you could keep a parallel array with boolean values that indicates whether or not an element at a particular index has been processed already, and just skip values that have already been processed.