The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
0 votes

Consider the following function that takes as input a sequence $A$ of integers with n elements, $A$$\left [ A1 \right ]$, $\left [ A2 \right ], \ldots, \left [ An \right ]$and an integer $k$ and returns an integer value. The function length$(S)$ returns the length of sequence $S$. Comments start with //.

function mystery(A, k){
n = length(A);
if (k > n) return A[n];
v = A[1];
AL = [ A[j] : 1 <= j <= n, A[j] < v ]; // AL has elements < v in A
Av = [ A[j] : 1 <= j <= n, A[j] == v ]; // Av has elements = v in A
AR = [ A[j] : 1 <= j <= n, A[j] > v ]; // AR has elements > v in A
if (length(AL) >= k) return mystery(AL,k);
if (length(AL) + length(Av) >= k) return v;
return mystery(AR, k - (length(AL) + length(Av)));
  1. Explain what the function computes.
  2. What is the worst-case complexity of this algorithm in terms of the length of the input sequence $A$?
  3. Give an example of a worst-case input for this algorithm.
asked in Algorithms by Boss (16.1k points)
edited by | 115 views

1 Answer

+1 vote
Best answer
a. Function computes kth smallest element (if k<number of elements in the array, else it returns max element).
b. Time complexity = $O(k$*$n)$, where n is the number of elements in the array.
c. Worst case input: Array consists of a distinct increasing sequence of numbers and from this sequence, if we need to find nth smallest (i.e. max element) then it will take O$(n$*$n)$ time.
answered by Veteran (55k points)
edited by

basically worst case will be O(n2) when k=n

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

36,995 questions
44,571 answers
43,637 users