Google I/O is a wrap! Catch up on TensorFlow sessions
View sessions
tfp.substrates.numpy.stats.iterative_mergesort
Non-recusive mergesort that counts exchanges.
tfp.substrates.numpy.stats.iterative_mergesort(
y, permutation, name=None
)
Args |
y
|
a Tensor of shape [n] containing values to be sorted.
|
permutation
|
Tensor of shape [n] with original ordering.
|
name
|
Optional Python str name for ops created by this method.
Default value: None (i.e., 'iterative_mergesort').
|
Returns |
exchanges
|
int32 scalar that counts the number of exchanges required to
produce a sorted permutation
|
permutation
|
and a tf.int32 Tensor that contains the ordering of y values
that are sorted.
|
Except as otherwise noted, the content of this page is licensed under the Creative Commons Attribution 4.0 License, and code samples are licensed under the Apache 2.0 License. For details, see the Google Developers Site Policies. Java is a registered trademark of Oracle and/or its affiliates.
Last updated 2022-02-15 UTC.
[{
"type": "thumb-down",
"id": "missingTheInformationINeed",
"label":"Missing the information I need"
},{
"type": "thumb-down",
"id": "tooComplicatedTooManySteps",
"label":"Too complicated / too many steps"
},{
"type": "thumb-down",
"id": "outOfDate",
"label":"Out of date"
},{
"type": "thumb-down",
"id": "samplesCodeIssue",
"label":"Samples / code issue"
},{
"type": "thumb-down",
"id": "otherDown",
"label":"Other"
}]
[{
"type": "thumb-up",
"id": "easyToUnderstand",
"label":"Easy to understand"
},{
"type": "thumb-up",
"id": "solvedMyProblem",
"label":"Solved my problem"
},{
"type": "thumb-up",
"id": "otherUp",
"label":"Other"
}]