add a comment about posible improvements

diff --git a/src/catar/binary_search_tree.rs b/src/catar/binary_search_tree.rs
index ec614e125095b54b934a4e9ae7861491d6975561..ba996a94a6f451fda2945a2b412845953fa683b1 100644 (file)
--- 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]