mgatuiet
BAN USER
Comments (4)
Reputation 0
Page:
1
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
0
of 0 vote
1. Hash values in hash table, chain in increasing order of index i.e. a[i]=p, a[j]=p hash is done as Hash[p]--> i---> j such that i < j
2. make root
3. root->left= Hash[root->data]-->first element in chain (i)
4. root->right=Hash[root->data]--->second element in chain (j)
5. repeat
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Page:
1
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.
if m+n is even, median will be (min(A[ptA],B[ptB])+min(A[ptA-1],B[ptB-1]) )/2 see code:
- mgatuiet September 21, 2014