Given a linked list L storing n integers, present an algorithm (either in words or in a pseudocode) that decides whether L contains any 0 or not. The output of your algorithm should be either Yes or No. What is the running time of your algorithm in the worst-case, using O notation?

Describe an algorithm using pseudocode that takes a list of nintegers a1, a2, ..., an, and returns the product of the positive integers. Be sure to initialize thevariables. This doesn't have to be really long but just simple pseudocode. Here is what I have: procedure product (a1, a2,...,an: positive integers) product:=a1      for i=1 to n           If product < ai then product: = ai                     Return product {product is positive integers}   I'm not really sure if I'm right but the assignment wants a format similar to this. Please let me know what I need to change.

the drop down bar is the selection you have to choose from for each answer

Consider the following algorithm that uses a list of n elements (alist). What is the worst case runtime of this algorithm? for each element in alist    1. ask the user for an input, call it value    2. search value in alist using linear search    3. if value exists in alist, print "successful"       otherwise print "unsuccessful"      Question options: a. O(log n) b. O(n log n) c. O(2^n) d. O(1) e. O(n) f. O(n^2)

You are given k > 2 linked lists, each containing n > k natural numbers sorted in increasing order. All n · k numbers in these lists are distinct. Describe an algorithm that finds the k-th smallest element among all n k numbers. Your algorithm should run in O(k log k) time. Analyze the running time of your algorithm and prove its correctness.

What is the heuristic function of greedy best-first search? O f(n) not equals to h(n) f(n) less than h(n) f(n) equals h(n) O f(n) greater than h(n)

Suppose you have an algorithm that operates on a set of data with n elements. If the recurrence formula that computes the time requirement for the algorithm is given by T(n) = 87 (C (1) + Dn a. nlgn b. n² lg n c. n² d. n³ e. if n > 1 if n = 1 where D and C are constants, which of the following gives the order of complexity of the algorithm? none of the other answers

You are given an integer n and an array of unique integers blacklist. Design an algorithm to pick a random integer in the range [0, n − 1] that is not in blacklist. Any integer that is in the mentioned range and not in blacklist should be equally likely to be returned. Optimize your algorithm such that it minimizes the number of calls to the built-in random function of your language.

Write a recurrence for this algorithm and solve it to obtain a tight upper bound on the worst case runtime of this algorithm. You can use any method you like for solving this recurrence.

write a computer program that produces the desired output from the given input. Input: Elements in a finite set SOutput: Elements in ℘(S)Algorithm: Use recursion.