Skip to content

M_CodeJam_Algorithms_LowerBound_11

Jump to bottom
Andrew Koryavchenko edited this page Jun 17, 2018 · 6 revisions

Algorithms.LowerBound Method (IList(Single), Single, Int32, Int32)

Returns the minimum index i in the range [startIndex, endIndex - 1] such that list[i] >= value or endIndex if no such i exists

Namespace: CodeJam
Assembly: CodeJam (in CodeJam.dll) Version: 2.1.0.0

Syntax

C#

public static int LowerBound(
	this IList<float> list,
	float value,
	int startIndex,
	int endIndex
)

VB

<ExtensionAttribute>
Public Shared Function LowerBound ( 
	list As IList(Of Single),
	value As Single,
	startIndex As Integer,
	endIndex As Integer
) As Integer

F#

[<ExtensionAttribute>]
static member LowerBound : 
        list : IList<float32> * 
        value : float32 * 
        startIndex : int * 
        endIndex : int -> int

Parameters

 

list
Type: System.Collections.Generic.IList(Single)
The sorted list
value
Type: System.Single
The value to compare
startIndex
Type: System.Int32
The minimum index
endIndex
Type: System.Int32
The upper bound for the index (not included)

Return Value

Type: Int32
The lower bound for the value

Usage Note

In Visual Basic and C#, you can call this method as an instance method on any object of type IList(Single). When you use instance method syntax to call this method, omit the first parameter. For more information, see Extension Methods (Visual Basic) or Extension Methods (C# Programming Guide).

See Also

Reference

Algorithms Class
LowerBound Overload
CodeJam Namespace

Clone this wiki locally