Question: I just had a quick question on time complexity for the following > Given two unsorted arrays a1 and a2, merge them together, remove >
I just had a quick question on time complexity for the following
> Given two unsorted arrays a1 and a2, merge them together, remove > duplicates and put into ascending order
I can solve this in O(nlogn) time, but I'm interested to see how this would be solved with a brute force implementation, along with the time and space complexities.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
