*This preview shows
pages
1–2. Sign up
to
view the full content.*

This
** preview**
has intentionally

**sections.**

*blurred***to view the full version.**

*Sign up*
**Unformatted text preview: **sorted sequence which contains exactly the elements of both input sequences! 2. Calculate the number of comparisons in your algorithm depending on the length of the input sequences! For the following parts assume that the number of elements in the input list of mergesort is a power of two. 3. Estimate the order of the number of comparisons of the mergesort algorithm! 1 4. Discuss the disadvatages of mergesort and describe an algorithm in pseudocode that imple-ments an iterative procedure, i.e., does not need recursion!. Please hand in the solutions on October 1 right before class. Use your own handwriting! Late homework will not be accepted. 2...

View
Full
Document