'Partition x1' presentation slideshows

PRAM ALGORITHMS-2

PRAM ALGORITHMS-2. Merging. O(n) time serial algorithm X1= k[1:m] and X2=k[m+1:2m] , be sorted sequences O(logn ) algorithm Merging = rank of key k in X1 U X2 Let k be in X1 its rank be j in it Rank of k in X2 calculated in logn time using binary search (q) Total rank = j+q

246 views • 21 slides