Time complexity of merging two unsorted list of size m+n is – InterviewSolution

InterviewSolution

1.	Time complexity of merging two unsorted list of size m+n is
Answer» UST WONDERING what is the time complexty of merging two sorted arrays of SIZE n and m, given that n is ALWAYS greater than m.I was thinking of using merge sort, which I assume in this case will consume O(log n+m).I am not really good with big-oh and stuff. Please SUGGEST me the time complexity for this problem and let me know if there is an even optimized way of solving the problem.Thanks in advance@chetan2222

Discussion

No Comment Found

Related InterviewSolutions

Which sign is semicolom
There are 10,48,576 rows by 16,384 columns in excel true ot false
Comppund formula having single mathematical operator
Which is the best interpretation of the graph?A. A small amount of anxiety is not enough to help the students perform better on a test.B.The higher a student's anxiety, the greater the probability of a good test score.C. A small amount of anxiety can help students perform better on tests.D. The higher a student's anxiety, the lower the likelihood of overcoming it.
मेरी आमा र म निबन्ध
1. Which key is not used for selecting a range of cell in a worksheet?b. Shiftd. None of thesea. Ctrlc. Alt
List of Bidentate and monodentate ligands
What is Cycle case? Explain with example.
(9),CEF in base 16 to base 10
State whether it is true or false.1. 5X6 means a table with columns of 5 rows T or F2. MS PowerPoint is spreadsheet software T or F