From a62fcb9af11eee964731645bc3f68ebf8f37344b Mon Sep 17 00:00:00 2001
From: Emmanuel Fleury <emmanuel.fleury@gmail.com>
Date: Tue, 6 Aug 2019 19:12:51 +0200
Subject: [PATCH] Add some notes on complexity in glib/gqueue.c

Related to issue #3
---
 glib/gqueue.c | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/glib/gqueue.c b/glib/gqueue.c
index 0cc7ab200..f7acb945a 100644
--- a/glib/gqueue.c
+++ b/glib/gqueue.c
@@ -29,7 +29,8 @@
  *
  * The #GQueue structure and its associated functions provide a standard
  * queue data structure. Internally, GQueue uses the same data structure
- * as #GList to store elements.
+ * as #GList to store elements with the same complexity over
+ * insertion/deletion (O(1)) and access/search (O(n)) operations.
  *
  * The data contained in each element can be either integer values, by
  * using one of the [Type Conversion Macros][glib-Type-Conversion-Macros],