MCPcopy Create free account
hub / github.com/dhale/jtk / quickPartialSort

Method quickPartialSort

core/src/main/java/edu/mines/jtk/util/ArrayMath.java:8628–8646  ·  view source on GitHub ↗

Partially sorts the elements of the specified array in ascending order. After partial sorting, the element a[k] with specified index k has the value it would have if the array were completely sorted. That is, a[0:k-1] <= a[k] <= a[k:n-1], where n is the length of a. @param k the index. @param

(int k, byte[] a)

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers 5

sortAndCheckMethod · 0.80
benchMethod · 0.80
initMethod · 0.80
updateClipsMethod · 0.80
findMedianMethod · 0.80

Calls 2

quickPartitionMethod · 0.95
insertionSortMethod · 0.95

Tested by 2

sortAndCheckMethod · 0.64
benchMethod · 0.64