3 Consider the Hire Assistant problem We interview n candidates and always hire the best qualified so far Let n 5 for our example Find the probabilities that we hire exactly 1 time and 2 times Define the probabilities as Prhi where i 12 4 Solve a Suppose in a merge sort the array of n elements is splitted into arrays of 30 and 70 of the original array instead of dividing it into equal parts Show the best and worst case complexity for this array b Suppose we have to sort n elements using qu

Answer rating: 100% (QA)

In hiring problem the probablity to select candidate is best of first i is 1i ... View the full answer