42

Select one consider the following problem: Is it possible to create an O(n) algorithm (both time and space complexity) that will determine if there exists an element in the array, such that that element occurs (n/2 times in the array If the median can be computed in O(n) time, what is the time complexity of an algorithm that will determine if there exists an element such that the element occurs [n/2 times in the array ? Select one: O a O(n) O b. O (1 log n) c. O(log n) O d. On?) 0.0(1) the median can be computed na mo, what is the time complexity or an atgontem that will determine if there exists an element such that the clement occurs in/2 times in the array? Select one