Leonardo heap is the implicit data structure that uses only O(1) auxiliary data to implement smoothsort, an in-place algorithm offering average performance of O(n⋅log(n)) and O(n) in the best-case.
-
Updated
Feb 16, 2018 - Java
#
in-place
Here are 2 public repositories matching this topic...
Trick Question about transforming a matrix in-place
-
Updated
Nov 18, 2017 - Java
Improve this page
Add a description, image, and links to the in-place topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the in-place topic, visit your repo's landing page and select "manage topics."