recategorized by
1,827 views

5 Answers

0 votes
0 votes

The worst case will be 0(m+n-1) where “m” and “n” are the sizes of the respective lists

Why “-1” at the end?

because when the two lists are being compared and sorted, at the end 1 element might be left which requires no comparison, hence -1. 

Answer:

Related questions

6 votes
6 votes
5 answers
5
admin asked Mar 31, 2020
1,572 views
Merge sort uses :Divide-and-conquerBacktrackingHeuristic approachGreedy approach
2 votes
2 votes
1 answer
6
admin asked Mar 31, 2020
4,342 views
Which type of algorithm is used to solve the "$8$ Queens" problem ?GreedyDynamicDivide and conquerBacktracking
1 votes
1 votes
2 answers
7
admin asked Mar 31, 2020
1,926 views
The average search time of hashing, with linear probing will be less if the load factor :is far less than $1$equals $1$is far greater than $1$none of the options
2 votes
2 votes
4 answers
8