merge two sorted arrays without redundancy

By -
Merge two sorted arrays and sort them in order as specified at runtime. The two arrays may share common entries between them, but the resultant array must not have duplicates.
Please define this with space and time complexity.

Comments

  1. Tanmay ChakrabartyJune 16, 2011 at 10:09 PM

    Thanks for the problem. I am working on it. I will post the program soon.

    ReplyDelete
  2. Tanmay ChakrabartyJune 17, 2011 at 1:02 AM

    I have changed the problem a little bit as,

    Each inserted array may have different order, that is, it is not always that will be of the same order.

    If they are not ordered, the program must exit.

    Then the merged array will be in the ordered given by the user.

    Ans obviously the resultant array will not have any duplicate entries.

    Well, I half way done to this, but I think I will need more time. By the way, I do not know what "Define this with time and space complexity" means?

    ReplyDelete
  3. AdminJune 17, 2011 at 10:10 AM

    @Tanmay the last statement means what is time and space complexity of your program.time complexity should be o(n).

    ReplyDelete

Post a Comment

Popular posts from this blog

By -
Given an integer n, write a function that returns count of trailing zeroes in n!. Examples: Input: n = 5 Output: 1 Factorial of 5 is 20 which has one trailing 0. Input: n = 20 Output: 4 Factorial of 20 is 2432902008176640000 which has 4 trailing zeroes. Input: n = 100 Output: 24
Read more