List the resulting array after each iteration of the selection sort algorithm. Indicate the number of letter-to-letter comparisons made for each iteration. Sort the following array of letters (sort into alphabetical order): C Q S A X B T List the resulting array after each iteration of the insertion sort algorithm. Indicate the number of letter-to-letter comparisons made for each iteration. Sort the following array of letters (sort into alphabetical order): C Q S A X B T

Problem 2

For each problem given below, do the following: Create an algorithm in pseudocode to solve the problem. Identify the factors that would influence the running time of your algorithm. For example, if your algorithm is to search an array the factor that influences the running time is the array size. Assign names (such as n) to each factor. Determine the number of operations in each step of the pseudocode. To do that, identify the operations that must be counted. You need not count every statement separately. If a group of statements always executes together, treat the group as a single unit. If a method is called, and you do not know the running time of that method, count it as a single operation. Count the operations performed by the algorithm. Express the count as a function of the factors you identified in Step 2. Describe the best case scenario for the algorithm and derive the big O. Describe the worst case scenario for the algorithm and derive the big O. a. Determine if two arrays have no elements in common. b. Counting the total number of characters that have a duplicate within a string. (i.e. "gigi the gato" would result in 7 (g x 3 + i x 2 + t x 2) c. Finding a row where every entry is 'x' in a 2-D array.