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
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 :
how to delete an element(s) from an array; suppose I have an array x[10] = {1,2,3,4,5,6,7,8,9,10}, and I want to delete array{5} so that the values of the array become {1,2,3,4,5,7,8,9,10}; how do I go about this? This is not the same as setting the value of array{5} to null; but completely eliminating it so that it does not get printed alongside the other elements of the screen.
We can't use the std::vector, std::map and std::lists implementations.
std::realloc doesn't call the destructor automatically.
If it is theoretically possible, we'll consider it and write lines similar to it, which should remain commented until something similar is possible.
int main(){ #define START 1000000000 #define END 10 unsigned int * array=new unsigned int[START]; delete[START-END]array;//Our suggestion to shrink the array delete[]array;//Delete the array return 0; }
struct b { char fullname[100]; char title[100]; bopname };
and i declare a pointer to the struct as follows
b* bp;
and at runtime,
bp = new b[5];
In the end, is the statement delete[ ] bp enough to release the dynamically allocated memory. Or do i need to separately delete bp[0],bp[1]...
Does delete[ ] bp indicate that the array[ ] pointed by bp has to be deleted?? [I am confused as to how this happens, since the pointer only points at the 1st struct address]
I have to manage a Clinic. I need to delete a booking (for example, if John said he's coming on March 22nd at 15:30 but then he say he's not going to come, I have to delete that booking so another person can use it).
idSearched: the id of the person that is not going to come. I have a lot of specialties and each one has a list. So I ask for the speciality to delete the node (the node contains John's booking). If I don't find it, I return (-1). searchSpecByID return a pointer to the list where the speciality is. So head will point to the first node of the list. In nodeToDelete I have the node I want to delete.
The program detects OK when is the first in the list and when not, but it doesn't delete the node.
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 :
So I'm trying to make an employee list that holds the information so I can then delete or add from that array. I'm getting some errors regarding overloading function.
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;