I am trying to take the Array v[]={0,1,2,3,4,5,6,7,8,9} and put some of the numbers together so I can create a math problem. I have used next_permutation to get the possible combinations of the numbers. I am trying to check every combination to see if they work. Like v[1]v[2]v[4]v[0]v[3] to get then number 12403 (that is where I am having the problem) that I can subtract from v[7]v[2]v[0]v[1]= 7201 to get the answer 5202. How can you put v[1]v[2]v[4]v[0]v[3] together to get the number 12403?
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 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 :
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;
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:
I need to make a FOR loop for an array of 5 elements. (array[5]). The loop should pick the positions [1] and [4] and removes the integers positioned in it and the integers next to it should fill in the space like this:
Elements in Array: 23 24 25 26 27
Elements after deletion: 23 25 26 0 0
I'm having a hard time making one ....
Here's the code i tried to make (so far, i keep on failing):
#include<stdio.h> #include<conio.h> int main() { void del(int*, int); int array[5] = {23,24,25,26,27}; int z = 5;
Let's say I have an array of 10 elements. I want user to enter 9 numbers so that they fill arrays 0 to 8 (9 numbers). Now I shift the arrays +1. so array[0] is now array[1] and so on. Now I ask user to enter 10th number (fills array 0).
Here's my code(it doesn't shift arrays and doesn't ask for 10th num)
I have this code and so far it does everything it should although I'd like to know how to actually delete the elements from the array so after the duplicates have been removed the size of the array should be 7 and not 10.
#include<iostream> using namespace std; int main(){ int nums[10] = {2,7,2,5,4,0,7,6,9,0}; int a, b, t; int size; size = 10; //array size
I want to access the elements of my array dynamically. So far I've only figured out how to do this manually. if I tried it like this my code would work but there should be a better way right?
I can have at most 3 structs in array, but it could be 0,1,2 or 3 structs in array. I am trying to avoid dynamic memory allocation. I initialize sensors to 3 to reserve space for them in memory, since there may be at most 3 elements in the array. But I am testing a condition where there will only be 2 elements:
Code:
#include <stdio.h>#include <stdlib.h> #include <string.h> typedef struct { unsigned long long int address; float current; unsigned char pressure_units; } sensor;
[Code]...
The problem is even though there are only 2 sensors out of 3 in the array, sizeof(sensors)/sizeof(sensors[0]) returns 3. I assume because when it allocates memory for 3, it includes that allocated memory even though it really doesn't contain the struct. How can I figure out how many elements were really inserted into array, not just allocated to array?
I have a structure product_array *pa that contains a pointer *arr to an array of structs and count that adds 1 when a new product is added (set to NULL initially). I have to write a function which adds a new product entry to that array. One product entry has *title, *code, stock and price parameters. The array is dynamically allocated and I’m supposed to:
1. Reallocate space for array. 2. Update product_array. 3. Initialize it.
Also, code should be truncated to 7 characters.Products can be added multiple times, so the initial size is unknown.
Code:
void add_product(struct product_array *pa, const char *title, const char *code, int stock, double price) { for (int i = 0 ;; i++){ pa->arr = realloc(pa->arr, sizeof(struct product_array));
While removing duplicate elements from an array, if more than 4 array elements are same then removal does not work. however my logic seems to be alright. i reckon there is a problem with the conditions and assignments in the three for loops that i have used. the program is as follows:
Code: /*c program to remove duplicate elements in an array*/ #include<stdio.h> int main(void) { int array[30],i,j,k,n; printf("
[Code] ....
Take for instance if the input elements are 1,1,1,1,1,2,2,3,5 then after removal of duplicacy the array is 1,1,2,3,5.
