glib Balanced Binary Trees
- From: Philippe Leroux <lerouxp esiee fr>
- To: gtk-devel-list gnome org
- Subject: glib Balanced Binary Trees
- Date: Thu, 25 Jan 2001 11:19:03 +0100
Hi,
I'm creating an algorithm for 2d image segmentation (using a dynamic
programing approach) and am using glib to manage the memory allocation.
To evaluate the complexity of it I would need to know the complexity for
creating a Balanced Binary Tree with the glib. What would that be if I
insert n key/values?
Thank you for your help,
Philippe Leroux
PS when I'll be done, I'll try to make a plug-in for the Gimp
[
Date Prev][
Date Next] [
Thread Prev][
Thread Next]
[
Thread Index]
[
Date Index]
[
Author Index]