| Matthew Hanna 2004-12-13, 9:01 pm |
| marcelf3@yahoo.com wrote:
> Hello, here is the problem:
>
> I have to develop a DOS program in PASCAL with FREEPASCAL that reads a
> small txt freedb (musics data) database (47 MB) by loading it all to
> the memory. It is a final work of a course i am attending in college
> called "Data Structure and Algorithms" ("Estrutura de Dados e
> Algoritmos" in portuguese).
>
> We've learned some kinds of structure like: Lists,Trees and Graphs
> using variable pointers in PASCAL.
>
> So, i HAVE to load the entire txt file to the memory using some type of
> structure designed in pascal. What would be best to use? When
> searching, for each key pressed by the user, the program should show a
> list of 20 itens per page whith only music records starting with the
> typed characters. The user may search by title, album or singer.
>
> Could you tell me what would be the fastest structure and a quick pick
> on how to implement it?
> thank you all for the help.
> Marcel.
>
Hash table. Really big hash table. Oh! I know! A binary tree. No!
Wait! B-Tree! No! Better still! B+Tree! That'll do it! Oh, there
are so many ways! Where to begin? How would you do it by hand? That
might be a good place to start.
|