<<sum; } 19. void SwapArray(int NUMBERS[ ], int N) { inti, temp ; for ( i =0 ; i<N; i +=2) { temp=NUMBERS[i] ; NUMBERS[i] = NUMBERS[i+1]; NUMBERS[i+1] = temp; } } 20. The function definition is given below: void Reversearray(int a[ ], int size) { int temp, i, j; for(inti = 0, j=size-1;i<j; i+=,j--) { temp = a[i]; a[i] = a[j]; a[j] = temp; } } 21. void Arrange ( Student S[ ], int size) { inti,j; Student temp; cout<< “ Arranging in Descending Order\n\n”; for(i=0; i<size;i++) for(j=0 ; j<size-1-i; j++) { if( S [ j ] . marks < S [ j+1 ] .marks) { temp = S[j]; S[ j ] = S[ j+1 ]; S[j+1] = temp; } } } 22. void Arrange ( Employee E[ ], int size)
<<sum; } 19. void SwapArray(int NUMBERS[ ], int N) { inti, temp ; for ( i =0 ; i<N; i +=2) { temp=NUMBERS[i] ; NUMBERS[i] = NUMBERS[i+1]; NUMBERS[i+1] = temp; } } 20. The function definition is given below: void Reversearray(int a[ ], int size) { int temp, i, j; for(inti = 0, j=size-1;i<j; i+=,j--) { temp = a[i]; a[i] = a[j]; a[j] = temp; } } 21. void Arrange ( Student S[ ], int size) { inti,j; Student temp; cout<< “ Arranging in Descending Order\n\n”; for(i=0; i<size;i++) for(j=0 ; j<size-1-i; j++) { if( S [ j ] . marks < S [ j+1 ] .marks) { temp = S[j]; S[ j ] = S[ j+1 ]; S[j+1] = temp; } } } 22. void Arrange ( Employee E[ ], int size)
1287697811computer_science_-qp_objective.docx