Distributed Median
Alice has an array A, and Bob has an array B. All elements in A and B are distinct. Alice and Bob are interested in finding the median element of their combined arrays.

pseudocode:
     Input(A) 
     Input(B)
     Heapsort(A)
     Heapsort(B);
     While(1)
         start=1,end=n
        value=B[b]
         a=n-b
        if value>A[a]
            if value<A[a+1]
                output result  
                return 
            else                                  
                end=b-1          
          else if value<A[a]
             if  B[b+1]>A[a]
                output result  
                return         
             else
                start=b+1