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 ]