Skip to main content

Operator Overloading using Friend Functions with Complex Numbers

Operator overloading using friend functions:


Operators can be overloaded in c++ with friend functions also. The procedure is same as we discussed earlier. Here I will demonstrate operator overloading with "+" operator which is a binary operator. I will be using a complex number class (called complex). The class will have 2 data types, real and imaginary.
Operator overloading will not be a part of class complex, but we will declare that this function is a friend of class complex.

Note that since overloaded function is not part of class , so will require 2 args (overloading with member function require 1 arg for binary operator, as the first arg is the object itself.)
Use:
Most student wonder why we need to use operator overloading in such manner? The answer is simple, this will allow you to manipulate operator for predefined objects that you mat not have access. (Like cout or cin)

Code:

#include<iostream>


using namespace std;
// complex class with real and imaginary part
class complex
{
    public:
    int real;
    int img;
    //default constructor
    complex()
    {
        real=img=0;    
    }
    //overloaded constructor with 2 args
    complex(int x,int y)
    {
        real=x;
        img=y;    
    }
    //show function to display complex number
    void show()
    {
        cout<<"\n"<<real<<"+"<<img<<"i";
    }
    //declaring that "opeartor+" is friend of class complex
    friend complex operator+(complex c,complex d);
};

//operator+ is not part of complex class so have 2 args for + operator overload.
complex operator+(complex c, complex f)
{
    complex ans;
    ans.real=c.real+f.real;
    ans.img=c.img+f.img;
    return(ans);
}
int main()
{
    complex x(1,2), y(0,7);
    complex c=x+y;//overloaded + is called here
    //note that compiler will convert this to
    // c=operator+(x,y)
    c.show();
}

Popular posts from this blog

Find nth Prime Number in C++

c++ program to find prime numbers: The problem of finding prime number can be solved by checking all numbers, testing them for prime and then moving ahead. If you want to calculate nth prime. Then this can be done in a brutal way by checking the number one by one. This may sound odd, by there is no easy way then this  for prime numbers (Well Actually there are like Pollard's Rho Algorithm, Number Sieves or Shor's Quantum Algorithm, but we are talking about the one that most people may understand easily). There may be way to pre-calculate the prime numbers but that again is not sufficient. So how can we use c++ to create a program to find prime numbers.

Program to find nth Prime number in C

Objective: To print any Prime number in C.  This task may sound easy but is a very good exercise to help optimize CPU intensive programs. Finding Prime number is a very CPU hogging task and it becomes even more dreaded as the number starts to grow. Lets say we want to find 30001th prime. how will we find it?? Here is the program. Programming logic : The easiest method is to check if the given number N is divisible by any number from 2 to N-1. But it may be noted that we don't need to go beyond the number that is square root of N.  why?? lets have a look. Say we are testing number 49 for prime number. Our objective is to find any number that may divide it. so we start from 2,3,4 etc. As soon as we cross 7 there will be no number that will divide 49, if there was we have got it earlier since it will be smaller then 7.  Get it? another example 64 : 2x32 4x16 8x8 16x4 32x2 as you can see when we pass number 8 we don't need to test as the number that will come ,...