mergesort

Feb 26, 2014 at 7:35pm
I cant understand these things at all.
we have to solve the following using c++

a) Write a procedure which implements recursive Mergesort on a given
array of Items, using normal order (not bitonic) for merge without sentinels.
Your extra space usage must be Θ(n) for input size n.

b) Write a procedure which implements recursive Mergesort on a given
array of Items, using bitonic order for merge, of course, without sentinels.
Your extra space usage must be Θ(n) for input size n.
Feb 26, 2014 at 8:24pm
someone please help
Topic archived. No new replies allowed.