# RankedMax

RankedMax[list,n]

gives the n largest element in list.

RankedMax[list,-n]

gives the n smallest element in list.

# Examples

open allclose all

## Basic Examples(3)

The second largest of three numbers:

The third largest of four numbers:

Plot the second-largest function over a subset of the reals:

## Scope(22)

### Numerical Evaluation(4)

Evaluate the second largest of three numbers:

The fourth largesti.e the smallestof four numbers:

The second smallest of five numbers:

The fourth smallest of five numbers:

The fifth smallesti.e. the largestof five numbers:

Evaluate to high precision:

Evaluate efficiently at high precision:

### Specific Values(4)

Values at infinity:

Evaluate symbolically:

Solve equations and inequalities:

Find a value of x for which RankedMax[{Sin[x],Cos[x],Exp[x]},2]1:

### Visualization(3)

Plot RankedMax of several functions:

Plot RankedMax in three dimensions:

Plot RankedMax of three functions in three dimensions:

### Function Properties(8)

RankedMax is only defined for real-valued inputs:

The range of RankedMax is real numbers:

Basic symbolic simplification is done automatically:

Multi-argument ranked RankedMax is generally not an analytic function:

It will have singularities where the functions cross, but it will be continuous:

is neither nondecreasing nor nonincreasing:

is not injective:

is not surjective:

is non-negative:

### Series and Integration(3)

Series expansion of the second-largest function at the origin:

Asymptotic expansion at Infinity:

Integrate expressions involving RankedMax:

## Applications(7)

Plot the bivariate RankedMax functions:

Plot the contours of bivariate and trivariate RankedMax functions:

RankedMax[{y1,,yn,x},k] as a function of x:

Compute the expectation of the second smallest (median) variable:

Alternatively, use OrderDistribution:

Compute the probability of the second smallest variable being less than 1:

Find the height of the fourth tallest child in a class:

Find the second-largest Length of borders in kilometers:

It is the Czech Republic:

## Properties & Relations(6)

RankedMax[{x1,,xm},1] is equivalent to Max[x1,,xm]:

RankedMax[{x1,,xm},m] is equivalent to Min[x1,,xm]:

RankedMax[{x1,,xm},k] is equivalent to RankedMin[{x1,,xm},m-k+1]:

RankedMax[{x1,,xm},n] is equivalent to Quantile[{x1,,xm},(m-n+1)/m]:

RankedMax[{x1,,xm},n] is equivalent to Sort[{x1,,xm},Greater]n:

The equivalent Piecewise function has disjoint piecewise case domains:

Algebraically prove the piecewise case domains are disjoint:

Visually show it:

Algebraically prove the piecewise case domains are pairwise disjoint:

Visually show it:

## Neat Examples(2)

Two-dimensional sublevel sets:

Three-dimensional sublevel sets:

Wolfram Research (2010), RankedMax, Wolfram Language function, https://reference.wolfram.com/language/ref/RankedMax.html (updated 2017).

#### Text

Wolfram Research (2010), RankedMax, Wolfram Language function, https://reference.wolfram.com/language/ref/RankedMax.html (updated 2017).

#### CMS

Wolfram Language. 2010. "RankedMax." Wolfram Language & System Documentation Center. Wolfram Research. Last Modified 2017. https://reference.wolfram.com/language/ref/RankedMax.html.

#### APA

Wolfram Language. (2010). RankedMax. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/RankedMax.html

#### BibTeX

@misc{reference.wolfram_2024_rankedmax, author="Wolfram Research", title="{RankedMax}", year="2017", howpublished="\url{https://reference.wolfram.com/language/ref/RankedMax.html}", note=[Accessed: 27-May-2024 ]}

#### BibLaTeX

@online{reference.wolfram_2024_rankedmax, organization={Wolfram Research}, title={RankedMax}, year={2017}, url={https://reference.wolfram.com/language/ref/RankedMax.html}, note=[Accessed: 27-May-2024 ]}