0 votes 0 votes Number of comparisions in worst case required to merge two sorted arrays of size 40 and 60 are------- Algorithms algorithms merging array + – Kamalkant Patel asked Jan 30, 2016 • retagged Jun 25, 2022 by makhdoom ghaya Kamalkant Patel 286 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 1 votes 1 votes Total number of comparison in worst case are m+n-1 . So 60+40-1 = 99 Digvijay Pandey answered Jan 30, 2016 • selected Jan 30, 2016 by Pooja Palod Digvijay Pandey comment Share Follow See all 0 reply Please log in or register to add a comment.