Consider the following sort method. This method correctly sorts the elements of array arr into increasing order.

public static void sort(int[] data)
{
for (int j = arr. length - 2; i >= 0; j--)
{
int move = arr[i];
int k = j + 1;
while (k < arr. length && move > arr[k])
{
arr[k - 1] = arr[k]; /* Shuffle elements upwards */
k++;
)
arr[k - 1] = move; /* Insert value into position */
/* end of for loop */
3
}

Assume that sort is called with the array (5, 4, 3, 2, 1). How many times will the
expression indicated by /* Shuffle elements upwards and the statement indicated by /"
Insert value into position /execute?

A. Shuffle: 10, Insert: 5
B: Shuffle: 14, Insert: 4
C. Shuffle: 10, Insert: 4
D. Shuffle: 15, Insert: 5
E. Shuffle: 15, Insert: 4

It is not a good idea in a cover letter to mention another person whom the employer knows.

Program description: a c# app is to be created to produce morse code. the morse code assigns a series of dots and dashes to each letter of the alphabet, each digit, and a few special characters (such as period, comma, colon, and semicolon). in sound-oriented systems, the dot represents a short sound and the dash represents a long sound. separation between words is indicated by a space, or, quite simply, the absence of a dot or dash. in a sound-oriented system, a space is indicated by a short period of time during which no sound is transmitted. the international version of the morse code is stored in the data file morse.txt.

Some of your friends have gotten into the burgeoning field of time-series data mining, in which one looks for patterns in sequences of events that occur over time. purchases at stock exchanges--what’s being bought-- are one source of data with a natural ordering in time. given a long sequence s of such events, your friends want an efficient way to detect certain "patterns" in them--for example, they may want to know if the four events buy yahoo, buy ebay, buy yahoo, buy oracle occur in this sequence s, in order but not necessarily consecutively. they begin with a collection of possible events (e.g., the possible’ transactions) and a sequence s of n of these events. a given event may occur multiple times in s (e.g., yahoo stock may be bought many times in a single sequence s). we will say that a sequence s’ is a subsequence of s if there is a way to delete certain of the events from s so that the remaining events, in order, are equal to the sequence s’. so, for example, the sequence of four events above is a subsequence of the sequence buy amazon, buy yahoo, buy ebay, buy yahoo, buy yahoo, buy oracle their goal is to be able to dream up short sequences and quickly detect whether they are subsequences of s. so this is the problem they pose to you: give an algorithm that takes two sequences of even~s--s’ of length m and s of length n, each possibly containing an event more than once--and decides in time o(m n) whether s’ is a subsequence of s