Skip to main content

Understanding Constructors in C++

What are Contructors in C++?
Ans: Constructor are special function that can help initialize an object.
Do we really need contructors in C++?
Well, Its a good feature and really helps programmer.
I am a good programmer and I don't Need contructors.
LOL !!!!!
Ok enough of chit chat, lets get to the point. Why contructors were included in C++. The answer lies in very nature of programmers. Programmer frequently get messy with code and allow mistakes to happen ( LOL :P). How? Lets have a look on following code :



#include<iostream>

using namespace std;

int main()
{
int k;
cout<<k;
}
This is a classical example of programmer forgetting to initialize the variable. Hence causing unexpected errors. This problem gets more complicated as we start creating objects. Since objects may have many data, its a very common mistake to forget to initialize the data portions of objects. This is where construcors come handy. The contructors have a property that they get called automatically when objects gets created.
#include<iostream>

using namespace std;
class Me
{
     int x,y;
    public:
   Me()
   {
      x=y=0;
   }
   void show()
   {
       cout<<x<<","y;
   }
};
int main()
{
  Me x;
x.show();
}
Declaring a Constructors will ensure that whatever initialization are put into the contructors to execute always whenever object gets created. Hence objects data will always will be in initialize state.
How to declare Contructors in C++?
Its really easy, just follow the following rules :
  • Contructors are public.
  • Constructors don't have any return type.
  • Constructors name is always as that of the Class.
  • Constructors with no arguments are called default constructors.
  • Constructors can be overloaded.
So next time you put some initialization code in a contructors, your object won't have garbage values in them.
Happy coding.

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 ,...