Skip to main content

Increment operator in c# programming

Those operator, which is used for increment by one in any value known as increment operator. These are two types.

  1. Pre-increment operator
  2. Post-increment operator 
In pre-increment operator appear before its operand, such as ++a. Here "a" is a operand and ++ is the increment operator. In this case, value of the operand(a) will be incremented by one "after" it has been incremented.

In post-increment operator appear after its operand, such as a++. Similarly again, "a" is a operand and ++ is the increment operator.In this case, value of the operand(a) will be incremented by one "before" it has been incremented.

Lets take an simple example of both pre and post increment
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace ConsoleApplication1
{
    class Program
    {
        static void Main(string[] args)
        {

            double a;
            a = 1.5;
            Console.WriteLine(++a);
            a = 1.5;
            Console.WriteLine(a++);
            Console.WriteLine(a);

            Console.ReadKey();

        }    

    }

}

Code generate the following output

Increment operator in c# programming

In this example, variable a hold 1.5 double number. When compiler compile third line of statement, which is 
Console.WriteLine(++a). Pre-increment the value by one according to above definition. In forth line of statement again variable a replace with 1.5 double number. According to post-increment, first print same value of variable a (according to line-5) that is 1.5 , after that value has been incremented by one (according to line-6) that is 2.5.

Increment operators in expression

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace ConsoleApplication1
{
    class Program
    {
        static void Main(string[] args)
        {

            int a = 7;
            Console.WriteLine(++a * a++ + a++ * ++a);
            Console.ReadKey();

        }      

    }
}

Code generate the following output

Increment operator in c# programming
In this example, compiler first check operator precedence, here multiply sign take high precedence than addition sign. Also expression evaluate left to right, so first variable a is pre-incremented (value of a=8) also multiply with post-increment variable( a=8). So the result of first half is 64. In the next half, the value of variable a is post-incremented ( value of a=9) also multiply with pre-incremented (a=11 according to above definition). So the result of second half is 99. Now add both result, 64+99 is 163.

Comments

Popular posts from this blog

difference between structure and union in C Language

In c language article we will see the difference between union and structure. Both are the user define datatype in c language. See the table which is mentioned below: ASP.NET Video Tutorial Series Structure Union1.The keywordstruct is used to define a structure 1. The keyword union is used to define a union. 2. When a variable is associated with a structure, the compiler allocates the memory for each member. The size of structure is greater than or equal to the sum ofsizes of its members. The smaller members may end with unused slack bytes. 2. When a variable is associated with a union, thecompiler allocates thememory by considering the size of the largest memory. So, size of union is equal to the size of largest member. 3. Each member within a structure is assigned unique storage area of location. 3. Memory allocated is shared by individual members of union. 4. The address of each member will be in ascending order This indicates that memory for each member will start at different offset v…

Difference between Linear search and Binary Search in c language

SQL Video Channel : Download all SQL Video



Binary Search Linear Search Works only on sorted items. such as  1,2,3,4,5,6  etc
Works on sorted as well as unsorted items. 12,4,5,3,2,1 etc Very efficient if the items are sorted Very efficient if the items are less and present in the beginning of the list. such as Suppose your list items are : 12,3,4,5,1 and you want to search 12 number then you get beginning in the list. Works well with arrays and not on linked lists. Works with arrays and linked lists.
Number of comparisons are less More number of comparisons are required if the items are present in the later part of the array or its elements are more.

Memory representation of Linked List Data Structures in C Language

Memory representation of Linked List

             In memory the linked list is stored in scattered cells (locations).The memory for each node is allocated dynamically means as and when required. So the Linked List can increase as per the user wish and the size is not fixed, it can vary.

               Suppose first node of linked list is allocated with an address 1008. Its graphical representation looks like the figure shown below:


      Suppose next node is allocated at an address 506, so the list becomes,



  Suppose next node is allocated with an address with an address 10,s the list become,


The other way to represent the linked list is as shown below:




 In the above representation the data stored in the linked list is “INDIA”, the information part of each node contains one character. The external pointer root points to first node’s address 1005. The link part of the node containing information I contains 1007, the address of next node. The last node …