diff --git a/dlib/clustering/bottom_up_cluster_abstract.h b/dlib/clustering/bottom_up_cluster_abstract.h
index 56e0e1c15..72d362c12 100644
--- a/dlib/clustering/bottom_up_cluster_abstract.h
+++ b/dlib/clustering/bottom_up_cluster_abstract.h
@@ -120,6 +120,7 @@ namespace dlib
               clustering.  This routine uses a combination of bottom up clustering and a
               simple greedy scan to try and find the most compact set of ranges that
               contain all the values in x.  
+            - This routine has approximately linear runtime.
             - Every value in x will be contained inside one of the returned snl_range
               objects;
             - All returned snl_range object's will have a width() <= max_range_width and