0

What would be the time complexity associated with concatenating arrays? Not merging them as in merge sort, but simply concatenating them using System.arraycopy(). Thanks.

Improve this question
7
  • What do you think it would be? Why do you think so? Why do you have doubts? Commented Aug 25, 2014 at 21:22
  • 1
    Surely, it's just adding to the new array with all the entries of the other? Which would be O(n). Commented Aug 25, 2014 at 21:22
  • ^That's what I think, but I'm trying to ask for expertise from someone who might know more about the inner workings of the function. Commented Aug 25, 2014 at 21:23
  • read this question stackoverflow.com/questions/18638743/… Commented Aug 25, 2014 at 21:24
  • 1
    @StriplingWarrior - On second thoughts agreed. And besides that, after a little digging around the implementation of arraycopy() is platform dependent so there probably isn't a single canonical answer anyway. Commented Aug 25, 2014 at 21:34
Related questions
27496
Why is processing a sorted array faster than processing an unsorted array?
7612
Why is subtracting these two epoch-milli Times (in year 1927) giving a strange result?
7743
Is Java "pass-by-reference" or "pass-by-value"?
Load 7 more related questions Show fewer related questions

0

Reset to default

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.