1.Write a code for finding maximum and minimum of a two number without using conditional statements

• Note: abs is an inbuilt function in c which always returns only positive integer only......

Swap two numbers without using third variable

METHOD 1:

The bitwise XOR operator can be used to swap two variables.

The XOR of two numbers x and y returns a number which has all the bits as 1 wherever bits of x and y differ.

For example XOR of 10 (In Binary 1010) and 5 (In Binary 0101) is 1111 and XOR of 7 (0111) and 5 (0101) is (0010).

    x = x ^ y; // x now becomes 15 (1111) 

    y = x ^ y; // y becomes 10 (1010) 

    x = x ^ y; // x becomes 5 (0101) 

Note:It is the best approach compared to other 2 methods.

METHOD 2:

The idea is to get sum in one of the two given numbers. The numbers can then be swapped using the sum and subtraction from sum.

        x = x + y; 

        y = x - y; 

        x = x - y; 

Note:Arithmetic solutions may cause arithmetic overflow. If x and y are too large, addition and multiplication may go out of integer range.

METHOD 3:

Multiplication and division can also be used for swapping.

        x = x * y; 

        y = x / y; 

        x = x / y; 

Note:The multiplication and division based approach doesn’t work if one of the numbers is 0 as the product becomes 0 irrespective of the other number.

Swap three numbers without using third variable

METHOD ( XOR )

        x=x^y^z;

        y=x^y^z;

        z=x^y^z;

        x=x^y^z;

Note:

• Using XOR operator (^) N-numbers can be swapped without using any temp variable.

Swap N-numbers without using third variable

        x1=x1^x2^x3^....^xn;

        x2=x1^x2^x3^....^xn;

        x3=x1^x2^x3^....^xn;

         .

         .

        xn=x1^x2^x3^....^xn;

        x1=x1^x2^x3^....^xn;

• The above code shows the general syntax for swapping n-numbers without any temp variable.