KnowledgeHub
Questions
Tags
Users
Search
Alex Rivera
|
Logout
Edit Question
Title
Body
I was just 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.
Tags (comma-separated)
Save Edits
Cancel