Skip to main content

Adding two number wihtout arithmatic operation and without loop


Here is algo:

1. Receive A and B as input.
2. if A or B is zero then goto step 8.
3. xor_a_b = A^B
4. and_a_b = A & B << 1
5. A = xor_a_b
6. B = and_a_b
7. goto step 2
8. Print non zero value of A, B



Lets try doing some example to understand how things work with above logic
A | B | A^B | A&B|A&B<<1
2  | 3 | 01     | 10| 100
1 | 4 | 101|0|0
0|5

If Any of operand is zero, return other operand which is Sum. So 5 is answer.

Let try with other arguments

A | B | A^B | A&B|A&B<<1
5  | 7 | 010    | 101| 1010
2 | 10 | 1000|10|100
8|4|1100|0|0
12|0

So operand 2 is zero, so result is 12.

Comments

Popular posts from this blog

Car Parking Problem

There is n parking slots and n-1 car already parked. Lets say car parked with initial arrangement and we want to make the car to be parked to some other arrangement. Lets say n = 5, inital = free, 3, 4, 1, 2 desired = 1, free, 2, 4 ,3 Give an algorithm with minimum steps needed to get desired arrangement. Told by one of my friend and after a lot of search i really got a nice solution. I will post solution in comment part

Two numbers with minimum difference

Find the two numbers whose difference is minimum among the set of numbers. For example the sequence is 5, 13, 7, 0, 10, 20, 1, 15, 4, 19 The algorithm should return min diff = 20-19 = 1. Make an efficient algorithm, yeah best could be O(n). Not sure if i could use DP here, will post a solution tommorow. Let me know if you find a answer. Algorithm:MiniMumDiffN Get the size of array , say n. Get the range of array, range. Bucket Sort the above array. Search the above sorted array for minimum difference. This will be the minimum difference numbers. Now question comes where the range of above given array is very big. Algorithm:DivideArray Take an random element. Search for its position in array. Return the index of element. Algorithm:MiniMumDiff if array_range > MAXRANGE int mid = divideArray (arr,start,end); d1,max1 = MiniMumDiff( arr,start,mid-1); d2,max2 = MiniMumDIff(arr,mid+1,end); d3 = difference max1 and arr[mid] d4 = difference max2 and arr[mid] return minimum( d1,d2...

Merge two sorted array inplace

Given an integer array of which both first half and second half are sorted. Write a function to merge the two parts to create one single sorted array in place [do not use any extra space]. e.g. If input array is [1,3,6,8,-5,-2,3,8] It should be converted to: [-5,-2,1,3,3,6,8,8]