c++ function

Try this:

#include

using namespace std;

void sortArray(int a[], int start, int n, bool ascending)

{

int i, j, temp;

for(i = 1 + start; i < start + n; i++)

{

for(j = start + n - 1; j >= i; j--)

{

if(a[j - 1] > a[j])

{

temp = a[j - 1];

a[j - 1] = a[j];

a[j] = temp;

}

if(!ascending) // reverse elements

{

j = start + n - 1;

for(i = start; i < start + n/2; i++)

{

temp = a[i];

a[i] = a[j];

a[j] = temp;

j--;

}

void myfunction(int a[],int size,int n)

{

sortArray(a, 0, n, true);

sortArray(a, n, size - n, false);

}

int main()

{

int a[] = {3, 1, 0, 2, 4, 7, 5, 8, 9, 6};

myfunction(a, 10, 5);

for(int i = 0; i < 10; i++) cout << a[i] << " ";

cout << endl;

system("pause");

return 0;

}

The output should be:

0 1 2 3 4 9 8 7 6 5

1 Reply

Know the answer? Post it — somebody with the same question will find it here.