C++ Program for this algorithm

Question

Algorithm

(Traversing a Linear Array)Here LA is a linear array with lower bound LB and upper bound UB.This algorithm traverses LA applying an operation PROCESS to each element of LA. 1.[Initialize counter.]Set K:= LB. 2.Repeat steps 3 and 4 while K<=UB. 3.[visit element]Apply process to LA[K]. 4.[incease counter]set K:=K+1. [End of step 2 loop] 5. Exit

Abhishek Jaiswal · Answer

okay ... thank you can u please write for these 2 algos too. Algorithm 2 (inserting into a linear array)INSERT(LANKITEM) Here LA is a linear array with N elements and K is a positive integer such that K = K. 3. [Move jth element downward.] set LA[j+1] := LA [j]. 4.[Decrease counter.] set j := j -1. [End of step 2 loop] 5. [insert element] set LA[K] := ITEM. 6.[Reset N] set N:=N +1 7.Exit Algorithm 2 (Traversing a linear array)this algorithm traverses a linear array LA with lower bound LB and upper bound UB. 1. Repeat for K = LB to UB: Apply process to LA[K] [End of loop] 2.Exit

Vulpes · Answer

Sure try this: #include using namespace std; /* PROCESS doubles its argument say */ void PROCESS(int& i) { i *= 2; } int main() { int LA[] = {1 2 3 4}; int LB = 0; int UB = 3; for(int K = LB; K { PROCESS(LA[K]); } /* check it worked */ for(int K = LB; K return 0; } The output is: 2 4 6 8

Abhishek Jaiswal · Answer

can you please give me complete program in C++ please.

Vulpes · Answer

In C++ this algorithm can be represented by a for statement: for(int K = LB; K { PROCESS(LA[K]); } You could also use a while statement: int K = LB; while (K { PROCESS(LA[K]); K++; }