The range of a finite non empty set of n real numbers S is defined as the difference between the largest and smallest elements of S. For each representation of S given below, describe in English an algorithm to compute the range. Indicate the time efficiency classes of these algorithms using the most appropriate notation (O,Θ, or Ω ). a. An unsortedarray b. A sorted array c. A sorted singly linked list d. A binary search tree

Merge sort: what is its efficiency if the number of chocolates and students increases significantly. Also, what is the complexity analysis ( T(n) and O(n) ).   Iterative and recursive function: to distribute a given set of x to y, what is the complexity analysis ( T(n) and O(n) ) and which is better.

An ordinary ruler is a straight piece of wood where distances 0, 1, 2 . . . , N are marked, for some N ≥ 1. A sparse ruler (or simply a ruler ) is an ordinary ruler from which some of the numbers 1, . . . , N −1 may have been deleted. The number of marks on the ruler is its order and the value N is its reach. Here, we will represent a ruler as a Python list of strictly increasing integers starting with 0. For instance [0,1,3,7] is a ruler of order 4 and reach 7. A sparse ruler of reach N is complete if it is possible to measure all distances between 1 and N by taking the dierences between two marks. For instance [0,1,3] is complete because the pairs (0, 1), (1, 3), and (0, 3) yield distances of 1, 2, and 3 respectively. (Note that the pair of marks do not need to be consecutive.) On the other hand, [0,1,4] is not complete as there is no way to measure a distance of 2. could you please provide the code for this question in python , the parts in bold explain some of the concepts in this…

Given an ordered list, what is the Big-O of finding the smallest element in the list?

1. Write an algorithm to determine whether a given element x belongs to a set S := {s1, . . . , sn}.

Consider the following algorithms. Each algorithm operates on a list containing n elements, where nis a very large integer. I. An algorithm that accesses each element in the list twice II. An algorithm that accesses each element in the list n times III. An algorithm that accesses only the first 10 elements in the list, regardless of the size of the list Which of the algorithms run in reasonable time? A I only B III only I and II only D I, II, and II

This substring search problem seems like a bit of a toy problem. Do I really need tounderstand these complicated algorithms?