July 25, 2008 03:11pm pdt

1. jkr 727,650
2. Infinity08 477,951
3. evilrix 469,580
4. itsmeandn... 171,101
5. jaime_oliv... 96,523
6. josgood 78,798
7. ikework 62,815
8. Gurudenis 56,537
9. SeanDurkin 49,861
10. DanRollins 48,566
11. rstaveley 46,482
12. Zoppo 46,400
13. alb66 42,870
14. Kdo 37,444
15. JohnGaby 25,890

1. jkr 6,987,927
2. itsmeandn... 1,842,868
3. Axter 1,462,534
4. Infinity08 1,294,148
5. nietod 859,677
6. AlexFM 732,762
7. jaime_oliv... 658,178
8. DanRollins 614,769
9. evilrix 586,010
10. rstaveley 511,924
11. grg99 390,024
12. efn 315,320
13. chensu 313,112
14. AlexViroc... 263,393
15. Salte 247,544

04.23.2008 at 03:57AM PDT, ID: 23345997

	[x] Attachment Details

[x]

The Solution Rating System

With so many solutions, how can you tell which solutions are most likely to help you and which ones are not? To provide you with a tool to use, we rate our solutions based on various elements that most accurately determine if a solution is a quality solution. To explain what factors affect the solution rating, here are the elements we take into consideration when formulating our solution rating.

The Grade of the Solution
The Zone Rank of the Expert Providing the Solution
The Number of Author and Expert Comments
The Number of Experts Contributing
The Feedback of the Community

Your Input Matters
Because of the way the system is set up, the most important variable in this equation is you. As a member of Experts Exchange, you are able to cast your vote on the quality of the solutions in regard to how complete, accurate, helpful and easy to understand each solution is. When you provide your feedback, each rating is adjusted accordingly. So, if you see a solution that has a poor rating that you think is a good solution, let us know by rating it. As you do, the rating will be adjusted and will become more accurate for other members of our site.

If you have any suggestions that you would like to make for our rating system, please ask a question in the Suggestions Zone of Community Support.

Thank you!

8.0

HugeInteger add(), subtract(), and multiply() not functioning correctly!

Zone: C++ Programming Language

Tags: C++

Ok, here are my problems:
the add() function is only adding positive numbers right now. My subtract() function is not subtracting correctly if the this.number is smaller then the bigNumber2 nor does it care about isNegative at this point, and I am lost on multiply(completely lost). I am getting confused alot as to how to implement this. I have a class HugeInteger that takes in positive and negative integers and stores then in a 40 element array. As of right now, my constructor, input and output are all functioning correctly. So a -1234 is stored as 0 0 0 ,..., 0 0 0 1 2 3 4 with a bool flag isNegative, and 1234 is stored as 0 0 0 ,..., 0 0 0 1 2 3 4 with a bool flag !isNegative.

Here is my .h file:
#ifndef HUGEINTEGER_H
#define HUGEINTEGER_H

#include <iostream>

class HugeInteger
{
public:
      HugeInteger();      //constructor
      void input();
      void output() const;

      void add(const HugeInteger &);
      void subtract(const HugeInteger &);
      void Multiply(const HugeInteger &);

      bool equalTo(const HugeInteger &);
      bool notEqualTo(const HugeInteger &);
      bool greaterThan(const HugeInteger &);
      bool greaterThanOrEqualTo(const HugeInteger &);
      bool lessThan(const HugeInteger &);
      bool lessThanOrEqualTo(const HugeInteger &);
      bool isZero();

private:
      bool isNegative;
      char line[41];
      int bigNumber[40];      //array to hone users inputted integer
      int const arraySize;      //const array size

};      //End class HugeInteger

#endif

Starting with my add() function problem. my brain says if you are adding two positive or two negative numbers you add and if they are one of each you subtract. but after that I get stuck. do I send the addition to the subtract() function or do it in add, when it is done how do I tell it to handle whether the answer is negative or positive. Here is my add(), subtract() and multiply() functions.

         
           
             1:
2:
3:
4:
5:
6:
7:
8:
9:
10:
11:
12:
13:
14:
15:
16:
17:
18:
19:
20:
21:
22:
23:
24:
25:
26:
27:
28:
29:
30:
31:
32:
33:
34:
35:
36:
37:
38:
39:
40:
41:
42:
43:

           
           
             void HugeInteger::add(const HugeInteger &bigNumber2)
{
	//if both bigNumbers are positive or both are negative, add together
	//else subtract because neg + pos and pos + neg needs to be subtracted
	int carry = 0;	//holds carry over
	for (int loopSize = arraySize - 1; loopSize > 0; loopSize--)	//add all but last digit in array
	{
		int temp = bigNumber[loopSize];
		bigNumber[loopSize] = (temp + bigNumber2.bigNumber[loopSize] + carry) %10;	//remainder
		carry = (temp + bigNumber2.bigNumber[loopSize] + carry) / 10;
	}//end for
	
}//end add function
 
void HugeInteger::subtract(const HugeInteger &bigNumber2)
{
	//in progress
	int borrow = 0;
	for (int digitIndex = arraySize - 1; digitIndex > 0; digitIndex--)
	{
		//determine if first array integer needs a borrow value
		if (bigNumber[digitIndex] < bigNumber2.bigNumber[digitIndex])
		{
			int temp = bigNumber[digitIndex];
			bigNumber[digitIndex] = (temp + 10)
				- bigNumber2.bigNumber[digitIndex]- borrow; 
			borrow = 1;
		}//end if
		else
		{
			int temp = bigNumber[digitIndex];
			bigNumber[digitIndex] = temp - bigNumber2.bigNumber[digitIndex] - borrow;
			borrow = 0;
		}//end else
				
	}//end for
 
}//end subtraction function
 
void HugeInteger::Multiply(const HugeInteger &bigNumber2)
{
	//in progress
}//end multiply function

           
         

Start your free trial to view this solution

Question Stats

Zone: Programming

Question Asked By: rebelcowgirl_73

Solution Provided By: josgood

Participating Experts: 2

Solution Grade: A

Translate:

Loading Advertisement...