Write a function SORTPOINTS() in C++ to sort an array of structure Gam

1.	Write a function SORTPOINTS() in C++ to sort an array of structure Game in descending order of Points using Bubble Sort.Note. Assume the following definition of structure Gamestruct Game { long PNo; //Player Numberchar PName[20];float Points;};Sample Content of the array (before sorting)PNoPName Points103Ritika Kapur3001104John Philip2819101Razia Abbas3451105Tarun Kumar2971Sample Content of the array (after sorting)RollNoName Score101Razia Abbas3451103Ritika Kapur3001105Tarun Kumar2971104John Philip2819
Answer» void SORTPOINTS(Game G[ ], int N) { Game Temp; for (int I=0; I<N-1;I++) for (int J=0;J<N-I-1;J++) if (G[J].Points <G[J+1].Points) { Temp = G[J]; G[J] = G[J+1]; G[J+1] = Temp; } }

Write a function SORTPOINTS() in C++ to sort an array of structure Game in descending order of Points using Bubble Sort.Note. Assume the following definition of structure Gamestruct Game { long PNo; //Player Numberchar PName[20];float Points;};Sample Content of the array (before sorting)PNoPName Points103Ritika Kapur3001104John Philip2819101Razia Abbas3451105Tarun Kumar2971Sample Content of the array (after sorting)RollNoName Score101Razia Abbas3451103Ritika Kapur3001105Tarun Kumar2971104John Philip2819

Answer»

void SORTPOINTS(Game G[ ], int N)

{

Game Temp;

for (int I=0; I<N-1;I++)

for (int J=0;J<N-I-1;J++)

if (G[J].Points <G[J+1].Points)

{

Temp = G[J];

G[J] = G[J+1];

G[J+1] = Temp;

}

Discussion

No Comment Found

Related InterviewSolutions

An array Arr[35][15] is stored in the memory along the row with each element occupying 4 bytes. Find out the base address and address of an element Arr[20][5], if the location Arr[2][2] is stored at the address 3000.
An array Arr[15][35] is stored in the memory along the column with each element occupying 8 bytes. Find out the base address and address of the element Arr[2][5], if the location Arr[5][10] is stored at the address 4000.
What is the pre-condition for applying binary search algorithm?
Write an algorithm to search for 66 and 71 in the following array:3, 4, 7, 11, 18, 29, 45, 71, 87, 89, 93, 96, 99Make use of binary search technique. Also give the intermediate results while executing this algorithm. Convert this algorithm into a C++ program.
Suppose X, Y, Z are arrays of integers of size M, N and M+N respectively. The numbers in array X and Y appear in descending order.Write a user defined function in C++ to produce third array Z by merging arrays X and Y in descending order.
Suppose A, B, C are arrays of integers of size M, N and M+N respectively. The numbers in array A appear in ascending order while the numbers in array B appear in descending order. Write a user defined function in C++ to produce third array C by merging arrays A ad B in Ascending order. Use A, B, and C as arguments in the function.
Suppose A, B, C are arrays of integers of sizes m, n, m+n respectively. The numbers in arrays A and B appear in descending order. Give an algorithm to produce a third array C, containing all the data of array A and B in ascending order.
Given two arrays of integers X and Y of sizes m and n respectively. Write a function named MERGE() which will produce a third array named Z, such that the following sequence is followed:(i) All odd numbers of X from left to right are copied into Z from left to right(ii) All even numbers of X from left to right are copied into Z from right to left(iii) All odd numbers of Y from left to right are copied into Z from left to right(iv) All even numbers of Y from left to right are copied into Z from right to left X, Y and Z are passed as argument to MERGE().e.g., X is {3, 2, 1, 7, 6, 3} and Y is {9, 3, 5, 6, 2, 8, 10} the resultant array Z is {3, 1, 7, 3, 9, 3, 5, 10, 8, 2, 6, 6, 2}
Write an algorithm to merge two arrays X[6], Y[5] stored in descending order. The resultant array should be in ascending order.
Write an algorithm to add corresponding elements of two matrices A[3 x 3] and B[3 x 3]

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment