Skip to main content

Operators in C++ : What are the different types of operators in C++?

Operators in C++

Operators are nothing but symbols that tell the compiler to perform some specific operations. Operators are of the following types -

1. Arithmetic Operators

Arithmetic operators perform some arithmetic operation on one or two operands. Operators that operate on one operand are called unary arithmetic operators and operators that operate on two operands are called binary arithmetic operators.
+,-,*,/,% are binary operators.
++, -- are unary operators.

Pre-incrementer : It increments the value of the operand instantly.

Post-incrementer : It stores the current value of the operand temporarily and only after that statement is completed, the value of the operand is incremented.

Pre-decrementer : It decrements the value of the operand instantly.

Post-decrementer : It stores the current value of the operand temporarily and only after that statement is completed, the value of the operand is decremented.

Example -

int a=10;
int b;
b = a++;
cout<<a<<" "<<b<<endl;
Output : 11 10
-------------
int a=10;
int b;
b = ++a;
cout<<a<<" "<<b<<endl;
Output : 11 11

2. Relational Operators

Relational operators define the relation between 2 entities.They give a boolean value as result i.e true or false.

Example -

We need to write a program which prints if a number is more than 10, equal to 10 or less than 10. This could be done using relational operators with if else statements.

int n;
cin>>n;
if(n<10){
cout<<"Less than 10"<<endl;
}
else if(n==10){
cout<<"Equal to 10"<<endl;
}
else{
cout<<"More than 10"<<endl;
}

3. Logical Operators

Logical operators are used to connect multiple expressions or conditions together. We have 3 basic logical operators.
Suppose : A=0 and B=1 
Operator Operation Example
&& AND operator. Gives true if both operands are nonzero (A && B) is false
|| OR operator. Gives true if atleast one of the two operands are non-zero.(A || B) is true
! NOT operator. Reverse the logical state of operand !A is true

If we need to check whether a number is divisible by both 2 and 3, we will use AND operator
(num%2==0) && num(num%3==0) If this expression gives true value then that means that num is divisible by both 2 and 3.
(num%2==0) || (num%3==0)
If this expression gives true value then that means that num is divisible by 2 or 3 or both.

4. Bitwise Operator

Bitwise operators are the operators that operate on bits and perform bitby- bit operations.

If shift operator is applied on a number N then,
1. N<<a will give a result N*2^a
2. N>>a will give a result N/2^a

5. Assignment Operators

= Assigns value of right operand to left operand A=B will put value of B in A
+= Adds right operand to the left operand and assigns the result to left operand.
A+=B means A =A+B
-= Subtracts right operand from the left operand and assigns the result to left operand.
A-=B means A=A-B
*= Multiplies right operand with the left operand and assigns the result to left operand.
A*=B means A=A*B
/= Divides left operand with the right operand and assigns the result to left operand.


Instagram 👇 

For more Queries

Comments

Popular posts from this blog

Sorting Techniques : Selection Sort , Bubble Sort , Insertion Sort

Sorting Techniques 1. Selection Sort: Idea: The inner loop selects the minimum element in the unsorted array  and places the elements in increasing order. Time complexity: O(N 2 ) #include <iostream> using namespace std; int main() {     int n;     cin>>n;   int arr[n];    for(int i=0;i<n;i++){          cin>>arr[i];   }  for(int i=0;i<n-1;i++){       for(int j=i+1;j<n;j++){            if(arr[j]<arr[i]){                 int temp =arr[j];                  arr[j]=arr[i];             arr[i]=temp;           }           }      }for(int i=0;i<n;i++){       cout<<arr[i]<<" ";    }   return 0; } 2. Bubble Sort: Idea: ...

Time and Space complexity : What does time and space complexity mean?

 Time and Space complexity                                  Time Complexity Time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the length of the input. Types of notations 1. O-notation: It is used to denote asymptotic upper bound. For a given function g(n), we denote it by O(g(n)). Pronounced as “big-oh of g of n”. It also known as worst case time complexity as it denotes the upper bound in which algorithm terminates. 2. Ω-notation: It is used to denote asymptotic lower bound. For a given function g(n), we denote it by Ω(g(n)). Pronounced as “big-omega of g of n”. It also known as best case time complexity as it denotes the lower bound in which algorithm terminates. 3. !-notation: It is used to denote the average time of a program. Comparison of functions on the basis of time complexity It follows the following order in case of time complexit...