Skip to main content

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,d3,d4)
else
return MiniMumDiffN(arr,start,end);


TC MiniMumDiffN - O(n)
TC DivideArray - O(n)
TC MiniMumDIff - O(log(range)n*2n)

And MiniMumDiff will be dividing range n in range 2 power (i) = n/range;
So MiniMumDiff will be if TC O(n)

Comments

  1. really stupid, big Oh of bucket is mn where n is number of elements and m is max no of digits in any number

    ReplyDelete

Post a Comment

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

DEShaw Interview Questions

ther are N numbers frm 1 to N and starting from index 1 we will keep deleting every alternate going in cyclic order with array. Only one element will be left at the end. Tell us the index of element in array we started. e.g. there are 5 nums 1 2 3 4 5 then after 1st iteration 1 3 5 will be remained. .. then 1 will be next to be elliminated and then 5 3 will remain alone... give sum efficient algorithm to calculate which numer will remain at the end Answer: 2*(n-2^p)+1 where p=floor(log2 n)

[Tree]..Is parent or grandparent?

There are two nodes given in a tree(not binary tree). Find whether one node is parent/grand parent of other. order should be O(1). tag root as 0 , tag left child as 00 , right child as 01. left child's left child as 000 , left's child's right child as 001 ... and so on. now let input be tags t1 and t2 if( (t1 == (t2>>1)) || (t2==(t1>>1))) return child parent relationship if( (t1 == (t2>>2)) || (t2==(t1>>2))) return child grand-parent relationship ... This solution can take a lot of space as the three grows. We can tag the node by number .. Root -0 1 -2-3-4 SO given two node get their tags.. Get Max of both t1, t2. Go for parent of that node if other node then return or check for parent of parent and check again for other node. With 2^32 value avaialable for indexing ..u wont run out of values.