Skip to main content

SWAP Two Values without using temporary variable

/**
    Program Name: Swap Two Numbers

    Description: This Program swaps two number, using XOR

    Author:  Tauqirul Haque
      
*/

#include <stdio.h>
#include <conio.h>

int main()
{
    int firstNumber, secondNumber;
  
    printf("Enter The First Number :  ");
    scanf("%d",&firstNumber);
  
    printf("\nEnter The Second Number :  ");
    scanf("%d",&secondNumber);
  
    printf("\n\nNumbers Before Swapping :  %d  <-> %d \n",firstNumber, secondNumber);
  
    firstNumber = firstNumber^secondNumber;
    secondNumber = firstNumber^secondNumber;
    firstNumber = firstNumber^secondNumber;
  
    printf("\nNumbers After Swapping :   %d  <->  %d \n",firstNumber, secondNumber);
  
}
Labels:

Comments

Post a Comment

Popular posts from this blog

Singly Linked List

/**     Program Name: Singly Linked List     Description: This Program is for Implemeting Singly Linked List     Author:  Tauqirul Haque         */ struct Linklist {     int item;     struct Linklist *next; }; typedef struct Linklist node; void insertAtBeginning(node **); void createAppendNode(node **); void insertInMiddle(node **); void deleteNode(node **); void displayNode(node **); void countNode(node **);  void searchElement(node **); void reverse(node **); void main() {     node *head = NULL;     int choice = 0;     while(choice != 9)     {             printf("\n\t\t\t1. Add Node At The Beginning ");     printf("\n\t\t\t2. Insert Element in the Middle ");     printf("\n\t\t\t3. Append New Node "); ...
23 comments
Read more

FINDING FACTORIAL OF A NUMBER

/**     Program Name: FINDING FACTORIAL     Description: This Program finds a Factorial of a Given Number     Author:  Tauqirul Haque         */ long fact(long n); void main() {     long n;     printf("Enter N : ");     scanf("%d",&n);         if(n < 0)   //if its a neg number then changing the sign     {         n = -n;     }         printf("The fact of %ld  =  %ld \n\n",n,fact(n)); } long fact(long n) {     if(n==0 || n==1)     {         return 1;     }     else     {         return n*fact(n-1);     } }
Post a Comment
Read more

SIMPLE QUEUE

/**     Program Name: SIMPLE QUEUE     Description: This program is for Implementing Simple QUEUE     Author:  Tauqirul Haque         */ #define SIZE 3 int front = -1; int rear = -1; int queue[SIZE]; void deleteElement(); void insertElement(); void displayElement(); void main() {     int ch;     while(ch !=4)     {         printf("\n\t\t1. Insert into queue..\n");         printf("\t\t2. Delete From Queue...\n");         printf("\t\t3. Diplay Queue...\n");         printf("\t\t4. Exit Program ...\n");                 printf("Enter Your Choice #  ");         scanf("%d",&ch);         ...
Post a Comment
Read more