Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include"varArray.h"
- #include <iostream>
- using namespace std;
- varArray::varArray(void){
- size = 0;
- array = new int[size];
- }
- varArray::varArray(const varArray& rhs){
- size = rhs.size;
- array = new int[size];
- for (int i = 0; i < size; i++) {
- array[i] = rhs.array[i];
- }
- }
- varArray& varArray::operator=(const varArray& rhs){
- delete [] array;
- array = new int[rhs.size];
- size = rhs.size;
- for (int i = 0; i < size; i++) {
- array[i] = rhs.array[i];
- }
- return *this;
- }
- varArray::~varArray(void){
- size = 0;
- delete [] array;
- }
- void varArray::addNumber(int number){
- // create a new array;
- //increment the size and copy the first array to the second one;
- int* ptr;
- ptr = new int[size + 1];
- size = size + 1;
- for(int i = 0; i < size - 1 ; ++i) {
- ptr[i] = array[i];
- }
- //put the number inside the last element of ptr;
- //delete old array;
- ptr[size - 1] = number;
- delete [] array;
- array = ptr;
- }
- void varArray::removeNumber(int number){
- int* ptr;
- ptr = new int [size - 1];
- for(int i = 0, ptrcounter = 0; i < size; ++i){
- if (array[i] != number) {
- ptr[ptrcounter] = array[i];
- ++ptrcounter;
- }
- }
- size = size - 1;
- delete [] array;
- array = ptr;
- }
- void varArray::output(void){
- cout << "your numbers: ";
- for (int i = 0; i < size; i++) {
- cout << array[i] << " ";
- }
- cout << endl;
- }
- void varArray::sortNumber(){
- int *ip;
- ip = new int[size];
- int originalSize =size;
- for(int j = 0; j < originalSize; ++j){
- int smallestNumber = array[0];
- for(int i = 1; i < size; ++i){
- if(array[i] < smallestNumber){
- smallestNumber = array[i];
- }
- }
- ip[j] = smallestNumber;
- removeNumber(smallestNumber);
- }
- delete [] array;
- array = new int[originalSize];
- for (int i = 0; i < originalSize; ++i)
- {
- array[i] = ip[i];
- }
- size = originalSize;
- 3}1
Advertisement
Add Comment
Please, Sign In to add comment