I thought I'm done doing mg activity, but my professor said that we need to use a Temporary Variable for Swapping but where to put it.
Here is his activity:
Activity: Swapping Create a program that accepts a 10-element array of type int. Where the 1st user-input is stored in the 1st element of the array; the 2nd user-input is stored in the 2nd element of the array; so on so forth until the last user-input stored in the last element of the array. Your source code should be able to SWAP the values of the 1st and 10th; 2nd and 9th; 3rd and 8th; 4th and 7th; and 5th and 6th elements. It should display the values of the original and the swapped values of the array. example:
Now I have to write a function show_exam_descending(Data d, string subCode) when I call show_exam_descending(d, "ENGL_S12") the program will execute to show all the students' exam scores in ENGL_S12 in DESCENDING order...
For this to run, I have declared a struct Data:
struct Data { string subjectCode; int studentCode; double examScore; );
For the search, I have written a function before to load all the data from the document by using pointer and dynamic arrays. It works so well. What troubles me is the way to swap the elements (i.e. examScore) of different students in struct dynamic arrays. I am able to display all of them, but don't know how to swap.
Write a program that gets a sequence of unsigned integers.the user can enter at most 100 integers.
After getting the numbers, the program allows the user to repeatedly choose one of the three options:
1. swap the location of two entries in the sequence. if this option is chosen the user is prompted to enter the two locations to be swapped.
2. print out the sequence.
3. repeatedly swap two locations in the sequence until getting back to the state before this operation started. then print out the number of swaps performed.
Write a program using user-defined function which accepts an integer array and its size as arguments and assign the elements into a two dimensional array of integers in the following format: If the array is 1,2,3,4,5,6, the resultant 2D array is
I have a question about one function in my program. Write a function that will replace players in a tim. New player gets in the game, and takes the place of one that leaves. Prototype of function is:
Code:
void replace(TEAM *p,PLAYER newplayer,int num)
where second parameter is new player, and the third is a jersey number of player who leaves the game.Two structures are defined as:
I am having problem in writing the code for the problem "To assign the elements of 1-D integer array into 2-D array of integers such as if the array is 1,2,3,4,5,6 The resultant 2-D array should be like :
In this string there are some numbers with a dash between them, for example, "5-10". I need to read these numbers in and then increment them. So "5-10" becomes "6-11", "6-11" becomes "7-12", etc.
So far I have:
Code: char temp[350]; //350 chars is plenty enough
// Copy the first characters BEFORE the numbers into a new char array. The next characters are the numbers. strncpy(temp, *objectData, 39); The next steps are: - Extract the two numbers from the C string (determining if the number is 0,2 or 3 digits long) and write them into two ints. I'm stuck here.
- Increment the ints
- Write the ints into the array with a dash inbetween.
Giving the following program, how do i access the swapping function. I've tried swapp::change <int> ( a, b ) ; and it gave me 4 errors. Here's the code:
#include <iostream> using namespace std; template <typename T> class swapp
So basically, I started out with each wizard == 1 winform, but then I found another way to do it by making the content of each wizard step a user control, then say, on initial deployment, it load usercontrol1, then when i click next, the panel hide usercontrol1 for usercontrol2 and so forth. Would it be feasible to create all usercontrols (all the wizard step) and add them in an array, then i can load them by index?
I am working on a program where I sort elements into alphabetical order and then when one is less than the other I swap them. I first did it by swapping the data but they want me to swap the nodes instead and I am having trouble doing that.
Node *add_node( Node *list, const string &s ) { struct Node *n = new struct Node; n->word = s; // copy string s to word n->next = 0;
// add node n to the list // the list should always be in ascending alphabetical order n->next = list; list = n;
I've been working on this linked list priority queue . I know that the root of the problem is in my swapUp() function (swapping the positioning of two nodes based on their priority), because the list works great up until it is called. The seg fault is not actually being caused by swapUp(), it's being caused by peekAt(), which returns the element in the node at position n. But the error does not occur unless swapUp() is called first, so that is where the issue is (I think).
There is also a seg fault being caused in the destructor, which I believe may have the same root cause in swapUp().
I have a question about one function in my program. Write a function that will replace players in a team. New player gets in the game, and takes the place of one that leaves. Prototype of function is:
void replace(TEAM *p,PLAYER newplayer,int num)
where second parameter is new player, and the third is a jersey number of player who leaves the game. Two structures are defined as:
84484-37.96-Castor, Kathy 39050-69.68-Chandler, Ben 26183-70.84-Costello, Jerry
I have successfully read each element the id, grade and name into 3 separate array. Now i need to add a new student with an id and grade
How do i do this?
This is what I have.
int addStudent( int Iarray[], double dArray[], string sArray[], int newID, double newGrade, string newName, int size ) { char ready; int index; cout << endl; cout << "Enter new student ID number : ";
I have a question regarding the elements of an array. Suppose I have a 3 by 3 string array (char x[3][4] ) , and I initialize all the elements to x's , the array would then look like this :
xxx xxx xxx
I'm curious if there will be a value if I try to access and element outside the array. As I have to write a code to determine if I have reached the end of an array. The only way I can think of is to border the entire array with o's , making it look like this :
Write the definition of a function reverse , whose first parameter is an array of integers and whose second parameter is the number of elements in thearray . The function reverses the elements of the array . The function does not return a value .
Code: void reverse(int a[], int num) { for ( int i=0; i <= num/2 ; i++){ int temp = a[i]; a[i] = a[num-i-1]; a[num-i-1] = temp; } }
This is supposed to be the answer but I'm not quite sure why this is. I understand everything up until the actual loop. For one, shouldn't "int i" be declared outside the loop (I thought perhaps this was an error in the solutions)?
The main thing that I do not understand is the conditional statement.
Code: i<=num/2;
I don't understand why the "num/2" is necessary here. Also I can't really remember but is there a command that actually reverses an array?
I am trying to write a program that reverses the elements of an array by using an function 'myreverse'. The function should reverse original array and return nothing.
In my program, the function 'myreverse' is not getting invoked and the original array is being displayed as it is.
#include <iostream> using namespace std; void myreverse(int arr[],int n) { int *p=&arr[n-1]; int temp; for(int i=0;i<n;++i)
I'm having trouble getting my array to add its values together. I have a similar program running fine with the exact same equation. I am not so naive as to believe that this means it should run with every program but I'm at a loss as to what to do.
#include <iostream> #include <iomanip> using namespace std;
something in this part is making it go wrong, it displayes the original array fine but when it tries to shift it it goes haywire. EDIT: also how would i add elements onto the array?
im trying to write a program that finds the max in an array and divedes it by two than oututs a modfied list with all the elements greater than the max/2.
I got the first part but just not sure how to find the elements greater than the max/2 and output them correctly into the modfied list.
#include <iostream> #include <iomanip> using namespace std;
