I need a stl-like container for an arbitraty linked data structure which is fully persistent and has time- and memory bounds of O(1) for each update step plus O(n) for the size of the structure. This is urgent, too, I need it until tomorrow evening. So please hurry when you write this for me!
Eh???? Speak English kokie29. You're right, its not hard to think, so stop ranting and write a legible sentence. If there is a specific concept you are struggling with in your code, post it for review. The fact that you stated a need by date of "Wed. August 6th" tells me this is an assignment in which case you need to work on it yourself and ask questions when stumped.
I love you how you entirely changed your post lol.
And it really amuses me how you think I don't know how to do it. Just because I won't (nobody will) write the entire code for you doesn't mean we don't know how to do it. You're the one in school, not us...