Question

For each problems segment given below, do the following: Create an algorithm to solve the problem Identify the factors that would influence the running time, and which can be known before the algorithm or code is executed. Assign names (such as n) to each factor. 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 or code. Express the count as a function of the factors you identified in Step 2. If the count cannot be expressed as a simple function of those factors, define the bounds that can be placed on the count: the best case (lower bound) and worst case (upper bound). Determine what the Best Case Inputs are, and the Worst Case Inputs are, and the efficiency of your implementation Transform your count formula into big-O notation by: Taking the efficiency with worst case input, Dropping insignificant terms. Dropping constant coefficients. a. Determine if 2 arrays contain the none of the same elements elements (assume all elements are distinct) b. Counting total number characters that have a duplicate within a string (i.e. "gigi the gato" would result in 7 (g times 3 + i times 2 + t times 2) c. Finding a row where every entry is 'a' in a 2-D array.

Answer 1

6on. 1. Flag-trete 10- return fal the in lhe

Count- zadu nt fol t-ton y, two anays with@p.でnht or. Ekonard.肖he Bot time

Algäthm coun Duplkcalex shl counl-o

Courding opeuaione Mtl ap_crurt-o qualy oi to n- Yu m- m-

3 ton Countin กา+1 lag-fel fei-ton ntt mtn a (a tals etuan true