First time here? Checkout the FAQ!
+1 vote

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


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  ]

asked in Programming by Active (1.3k points) 17 30
edited by | 119 views

2 Answers

0 votes
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.
answered by (51 points) 1 1 3
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.
0 votes
answered by Active (1.1k points) 7 13 27
Do you hav any algorithm/ code ?

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
Top Users Oct 2017
  1. Arjun

    23642 Points

  2. Bikram

    17188 Points

  3. Habibkhan

    8734 Points

  4. srestha

    6404 Points

  5. Debashish Deka

    5478 Points

  6. jothee

    5098 Points

  7. Sachin Mittal 1

    4882 Points

  8. joshi_nitish

    4478 Points

  9. sushmita

    4008 Points

  10. Rishi yadav

    3960 Points

Recent Badges

Popular Question Bikram
Regular Mr.OOPs
Avid Reader Venkat Sai
Popular Question jothee
Verified Human anchal Singh
Great Question Kathleen
Verified Human Ankita_ Pawar
Avid Reader kenzou
Notable Question Sumit Chaudhary 2
Nice Comment rahul sharma 5
27,380 questions
35,231 answers
33,389 users