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
Courtesy orkut ....did not verified as could not get the logic completely.
ReplyDeleteint median_of_5(int * x) {
if ( x[0] < x[1] ) swap( &x[0], &x[1] ) ;
if ( x[2] < x[3] ) swap( &x[2], &x[3] ) ;
if ( x[0] < x[2] ) { swap( &x[0], &x[2] ) ; swap( &x[1], &x[3] ) ; }
if ( x[1] < x[4] ) swap( &x[1], &x[4] ) ;
if ( x[1] < x[2] ) { swap( &x[1], &x[2] ) ; swap( &x[3], &x[4] ) ; }
if ( x[2] < x[4] ) swap( &x[2], &x[4] ) ;
return (x[2]) ;
}