JAVA PROGRAMMING Q4.1: You have two sequences of mutually-comparable items to sort: The sequences are identical in terms of their sizes, their items, and the current (unsorted) order of those items....

JAVA PROGRAMMING

Q4.1:

You have
twosequences of
mutually-comparable
items to sort:

• The sequences are identical in terms of their sizes, their items, and the current (unsorted) order of those items.


• One sequence is in an
  arrayand the other is in a
  linked list.
  


• For the array and the link list, make an argument for why the
  quick sortwould be best for one and the
  merge sort
  for the other.


• In the identified situation, give a
  quantitative
  answer based on
  big-O
  and
  other technical factors, not just a qualitative answer.


• Address the specifics of the two algorithms -- their operations, time efficiency, money use, etc. Assume no optimization

Q4.2:

Explain and/or illustrate
the specific changes made in each pass of an
Insertion Sort
on the following data:

47  4  22  13  9  12