From 48147efd12d23d2024f266e37613b0539c1dde3b Mon Sep 17 00:00:00 2001
From: Dietmar Maurer <dietmar@proxmox.com>
Date: Sat, 29 Dec 2018 19:43:25 +0100
Subject: [PATCH] add a comment about posible improvements

---
 src/catar/binary_search_tree.rs | 8 ++++++++
 1 file changed, 8 insertions(+)

diff --git a/src/catar/binary_search_tree.rs b/src/catar/binary_search_tree.rs
index ec614e12..ba996a94 100644
--- 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]