This document describes an algorithm for exchanging the values of two variables. It involves: 1) Saving the original value of the first variable (a) in a temporary variable (t) 2) Assigning the value of the second variable (b) to the first variable (a) 3) Assigning the value stored in the temporary variable (t), which contains the original value of the first variable, to the second variable (b) This exchanges the values stored in the two variables.

1. ALGORITHM FOR
EXCHANGING TWO VALUES

2. EXCHANGING THE VALUES OF TWO VARIABLES


Problem statement
To exchange the values of the variables assigned to
them.
Algorithm development
The problem of interchanging the data associated
with two variables involves a very fundamental
mechanism that occurs in many sorting and data
manipulation algorithm.
Ex:
a
b
4
5
Here a has 4 and b has 5. our aim is to replace the
variable of a with 4 and b with 5.

3. So the target solution may look as
a
5
b
4
Here we can make use of the assignment operator
a = b; b = a;
where the b value is assigned to a. the value has been
changed, and the changed a value has been assigned to b.
a = 5,
b=5

4. So we make use of the temporary variable.
t = a;
a = b;
b = t;
Now,
t = 4, a = 5, b = 4
Our target solution has been achieved.

5. Algorithm Description:
1. Save the original value of a in t.
2. Assign to a the original value of b.
3. Assign to b the original value of a that is stored
in t.

6. Program Implementation
# include <iostream.h>
#include <conio.h>
main ()
{
int a = 4, b = 5, t;
cout<<“The original value of a=“<<a<<“b=“<<b;
t = a;
a = b;
b = t;
cout<<“After exchanging a=“<<a<<“b=“<<b;
}

7. APPLICATION

This kind of swapping technique is applicable
for all kinds of sorting algorithm.