Skip to main content

4 Different methods to swap 2 numbers

Swapping 2 numbers is one of the favorite questions asked to a lot of people during their interviews. There are a lot of ways to swap 2 numbers. In this post we have 4 methods that can be used to swap 2 numbers.

First Method : Using addition and subtraction method
This method is a simple method that can be used to swap 2 numbers, the method can be used for all integer, float and double variables. The method involves one addition and two subtraction operations.




Second Method : Using multiplication and division operators
This method is simply obtained by replacing + by * and - by / operator in the above method, but this method cannot be used when one of the numbers is 0 as it involves division operation.



Third Method : Using the EX-OR operation
This method involves repeated ex-or operations between 2 numbers to swap 2 numbers. But this method can be used only for integers and cannot be used for float or double variables as bit operations for them are not defined.


Fourth Method : Using temp Variable
This is the simplest and the most common method used by a lot of people.



The Following is full C implementation of the above described methods.

C Program

Sample input and output to check the program


OUTPUT

Different methods to swap 2 numbers



You might also be interested in 

Bubble Sort
Insertion Sort
Selection sort
Shell Sort
Hashing with Linear Probing
Hashing with Quadratic Probing
Double Hashing
Labels:

Comments

Post a Comment

Popular posts from this blog

Home Page

List of All Programs The Following is the List of all the programs on my Blog Math Programs Square Root of a number using Babylonian Method Finding The Next Smallest Palindrome Finding the Armstrong Numbers Factorial of a number GCD using Euclid's Algorithm Check if a number is Fibonacci Number or not LCM of 2 numbers Trailing Zeros in factorial of a number Sorting Algorithms Bubble Sort Algorithm Selection Sort Algorithm Insertion Sort Algorithm Shell Sort Algorithm Counting Sort Algorithm Linked List Programs Simple Singly Linked List Linked List in C++ Linked List in Python Linked List in Java Doubly Linked List Finding Kth element from the end of Linked List Delete a node from Linked List Delete Kth element from the end of Linked List Rotate Linked List in an Anti-clockwise direction Reversing first K nodes of a Linked List Binary Search Tree Left View of Binary Tree Righ...
4 comments
Read more

Hashing with Quadratic Probing

Hashing is a technique used for storing , searching and removing elements in almost constant time. Hashing is done with help of a hash function that generates index for a given input, then this index can be used to search the elements, store an element, or remove that element from that index. A hash function is a function that is used to map the data elements to their position in the data structure used. For example if we use an array to store the integer elements then the hash function will generate position for each element so that searching, storing and removing operation on the array can be done in constant time that is independent of the number of elements in the array. For better look at the example below. now we face a problem if for 2 numbers same position is generated example consider elements 1 and 14 1 % 13 = 1 14 % 13 = 1 so when we get 1 we store it at the first position, but when we get 14 we see that the position 1 is already taken, this is a case of colli...
Post a Comment
Read more

Hashing with Linear Probing

Hashing is a technique used for storing , searching and removing elements in almost constant time. Hashing is done with help of a hash function that generates index for a given input, then this index can be used to search the elements, store an element, or remove that element from that index. A hash function is a function that is used to map the data elements to their position in the data structure used. For example if we use an array to store the integer elements then the hash function will generate position for each element so that searching, storing and removing operation on the array can be done in constant time that is independent of the number of elements in the array. For better look at the example below. now we face a problem if for 2 numbers same position is generated example consider elements 1 and 14 1 % 13 = 1 14 % 13 = 1 so when we get 1 we store it at the first position, but when we get 14 we see that the position 1 is already taken, this is a case of colli...
Post a Comment
Read more