it is an exercice and i can't do it.help me pls.

Question

Enter a one-dimensional integer array. Find the largest odd item. Next, make a cyclic shift to the left of the elements standing to the right of the found maximum, and once shift the elements to the right, standing to the left of the found maximum.

Answer 1

Can you please give an example of required output !!

Answer 2

A one dimsional array is:

    int array[20] = {33,86,6,38,67,18,91,5,51,20,54,94,4,9,31,17,71,80,22,14};
    int array_size = sizeof(array)/sizeof(*array);

Then you can find the maximum with:

    int max = INT_MIN, max_index = -1;
    for (int i=0; i<array_size; i++)
        if (array[i] > max) {
            max = array[i];
            max_index = i;
        }

The you can shift the items to the right of the max_index with:

    int temp = array[max_index+1];
    for (int i=max_index+1; i<array_size-1; i++)
        array[i] = array[i+1];
    array[array_size-1] = temp;

The you can shift the items to the left of the max_index with:

    int temp = array[max_index-1];
    for (int i=max_index-1; i>0; i--)
        array[i] = array[i-1];
    array[0] = temp;

You can see the whole program at https://onlinegdb.com/-2RkoUeHj