[lnkForumImage]
TotalShareware - Download Free Software

Confronta i prezzi di migliaia di prodotti.
Asp Forum
 Home | Login | Register | Search 


 

Forums >

comp.programming

About algorithmics and my StringTree...

Ramine

2/21/2015 2:24:00 AM


Hello,

I have come to an interesting subject...


If you look at the source code of my new and very fast StringTree here:

https://sites.google.com/site/aminer68/...


You will notice that it is now considered to have the same level of
quality as a good industrial library... so why i am doing this
affirmation ? cause what i have done is designing my StringTree
taking into account the important factor that is the time and space
algorithmic complexity of my algorithms, before i have used a
datastructure called StringList that you find in Delphi and Freepascal ,
this datastructure uses an array as an implementation, StringList adds a
key as a string type and an object as an element inside the array.. so
the add() method is fast, but the search method is "seqential", so the
time algorithmic's complexity of the search method of StringList is
sequential , so it is not good, so
i have tried to use another datastruture called HashedStringList
inside Delphi and FreePascal, this datastructure uses a hashtable
over StringList's datastructure to optimize the search in O(1) best
case complexity, but HashedStringList was still slow, this why i have
implemented my very fast HashStringList datastructure that you will
find inside the zip and that uses a hashtable to optimize the
StringList's datastructure and that render the search in O(1) time
complexity in best case and log(n) time complexity in average case,
this has allowed my StringTree to be very efficient and very fast,
also i have also treated my StringTree as a database that must be
indexed to become very fast, so i have indexed some "tables" inside
StringTree using my very fast HashStringList to render my StringTree a
very fast library , also i have rewrote almost all the methods of the
first StringTree and i have render it a powerful library, and i have
stressed tested it and you can be confident cause i think that it is
now realy stable. this is why i have said that my StringTree is now
considered to have the same level of quality as a good industrial
library...



You can download my StringTree from:

https://sites.google.com/site/aminer68/...



Thank you,
Amien Moulay Ramdane.