for data structure and algorithms

Question

Write an algorithm that applies right shift on one dimensional array (trace your algorithm on example array A:[0,9,2,10,3] and show the result of your trace steps as a table). (Do not use extra array while solving this problem)

Answer 1

//BORROW THE LOGIC FROM THE CODE !!!!

using namespace std;

#include <iostream>

RightShift(int * A, int n)

{

int iTemp=A[n-1];

for (int iLoop=n-1; iLoop>0; iLoop--)

{

A[iLoop] = A[iLoop-1];

}

A[0] = iTemp;

}

int main()

{

int A[] = {0,9,2,10,3};

RightShift(A,5);

for (int iLoop=0; iLoop<5; iLoop++)

{

cout << A[iLoop] << endl;

}

}