People,
I need an advice:
how to organize a fast key search table in a Spad program?
where in the FriCAS materials it is written about this?
For example, a finite table i : Integer --> descr : CertainDescription.
Binary search/store methods of O( log(card(table)) ) are sufficient.
May be, I could use an array. But
a) I do not like them,
b) it is not nice to reserve any fixed memory space for this array for
this table
(for example, we do not reserve space for a list).
Thanks,
------
Sergei
[email protected]
--
You received this message because you are subscribed to the Google Groups
"FriCAS - computer algebra system" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/fricas-devel?hl=en.
