object SortingL
The SortingL
companion object provides shortcuts for calling methods from
the SortingL
class.
- Alphabetic
- By Inheritance
- SortingL
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Value Members
- def imedian(a: Array[Long], k: Int): Long
Indirectly find the median value in the array.
Indirectly find the median value in the array.
- a
the array to be examined
- def iqsort(a: Array[Long]): Array[Int]
Fast, ascending, unstable indirect sort.
Fast, ascending, unstable indirect sort.
- a
the array to be sorted
- def iselsort(a: Array[Long]): Array[Int]
Slow, ascending, stable indirect sort.
Slow, ascending, stable indirect sort.
- a
the array to be sorted
- def iselsort2(a: Array[Long]): Array[Int]
Slow, descending, stable indirect sort.
Slow, descending, stable indirect sort.
- a
the array to be sorted
- def median(a: Array[Long], k_: Int = -1): Long
Find the median value in the array.
Find the median value in the array.
- a
the array to be examined
- k_
specification for k-th smallest element
- def median3(a1: Long, a2: Long, a3: Long): Long
Find the median of three unordered numbers.
Find the median of three unordered numbers.
- a1
the first number
- a2
the second number
- a3
the third number
- Annotations
- @inline()
- def qsort(a: Array[Long]): Unit
Fast, ascending, unstable sort.
Fast, ascending, unstable sort.
- a
the array to be sorted
- def qsort2(a: Array[Long]): Unit
Fast, descending, unstable sort.
Fast, descending, unstable sort.
- a
the array to be sorted
- def selsort(a: Array[Long]): Unit
Slow, ascending, stable sort.
Slow, ascending, stable sort.
- a
the array to be sorted
- def selsort2(a: Array[Long]): Unit
Slow, descending, stable sort.
Slow, descending, stable sort.
- a
the array to be sorted