Thanks all of you. I'm new to algorithms and data structure and I'm new in this forum. I have an assignment but not sure yet:
A. Describe a data structure which can effectively answer the following questions: 1. A list of actors (f) : Print a list of actors who took part in film* f * . 2. A list of films -(s): Print a list with all the films that actor s has been in. 3. Participation (s,f): Return true if the actor s took part in film f, and false if not. Explain the data structure and how the questioning is done. Analyse the worst case running time for the above queries- in asymptotic notation, as tight as possible In the analysis use e.g. F=number of films; S =number of actors; Fs= number of films actor s took part in; and Sf =number of actors who took part in film f. Thanks a lot for your help -- Med Venlig Hilsen/Kind regards Rose -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" 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/algogeeks?hl=en.
