add a comment about posible improvements

2018-12-29 19:43:25 +01:00 · 2018-12-29 19:43:25 +01:00 · 48147efd12
parent 0b78833d8e
commit 48147efd12
1 changed files with 8 additions and 0 deletions
--- a/src/catar/binary_search_tree.rs
+++ b/src/catar/binary_search_tree.rs
@ -24,6 +24,14 @@
 /// implements the data copy.
 ///

+// NOTES:
+//
+// https://en.wikipedia.org/wiki/Binary_heap
+// https://en.wikipedia.org/wiki/Heapsort
+//
+// ==> Maype it is possible to build a sorted array from unsorted
+// array inplace, using heapsort?
+
 fn copy_binary_search_tree_inner<F:  FnMut(usize, usize)>(
    copy_func: &mut F,
    // we work on input array input[o..o+n]