Question

Write C Program using Recursive Funtions for the Problem Described below and Analyse the Complexity Of the Code

Problem

Given an unordered array  arr[]  which contains n distincct numbers .  Propose a method which output the number which is neither maximum nor minimum . The algorithm / code  you propose should take minimum running time only. (Writte the code in C language)

[ hint : Do not spent time in sorting the array . Go for a direct method using Recursive Functions  ]

Answer 1

time complexity will be o(1) because we have to check only first three or any random three numbers present in array. thus the problem is independent of n.

Comments

if elements are repeating?

---

if elements are repeating then in wrost case there may be only one distinct element or two elements then it is impossible to find a third no. which is neither maximum nor minimum

---

Please do write the code and explain.

Answer 2

check this link : http://quiz.geeksforgeeks.org/gate-gate-cs-2015-set-2-question-32/

Comments

Do you hav any algorithm/ code ?