Question

Write pseudo-code not Java for problems requiring code. You are responsible for the appropriate level of detail. For all the questions in this set, assume you are working in arrays. 1. How many comparisons and interchanges (in terms of file size n) are performed by Simple insertion sort for the following files: i. A sorted file ii. A file that is sorted in reverse order (that is, from largest to smallest) iii. A file in which x[0], x[2], x[4]... are the smallest elements in sorted order, and in which x[1], x[3], x[5]... are the largest elements in sorted order, e.g. [3, 14, 5, 15, 9, 8, 11, 19].

          Write pseudo-code not Java for problems requiring code. You are responsible for
the appropriate level of detail. For all the questions in this set, assume you are
working in arrays.
1. How many comparisons and interchanges (in terms of file size n) are performed
by Simple insertion sort for the following files:
i.
A sorted file
ii.
A file that is sorted in reverse order (that is, from largest to smallest)
iii.
A file in which x[0], x[2], x[4]... are the smallest elements in sorted
order, and in which x[1], x[3], x[5]... are the largest elements in sorted
order, e.g. [3, 14, 5, 15, 9, 8, 11, 19].

Write pseudo-code not Java for problems requiring code. You are responsible for
the appropriate level of detail. For all the questions in this set, assume you are
working in arrays.
1. How many comparisons and interchanges (in terms of file size n) are performed
by Simple insertion sort for the following files:
i.
A sorted file
ii.
A file that is sorted in reverse order (that is, from largest to smallest)
iii.
A file in which x[0], x[2], x[4]... are the smallest elements in sorted
order, and in which x[1], x[3], x[5]... are the largest elements in sorted
order, e.g. [3, 14, 5, 15, 9, 8, 11, 19].

Added by Amy R.

Question

Please give Ace some feedback