Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked

Re: Re: Re: Re: Re: Re: Perl Internals: Hashes

by demerphq (Chancellor)
on Apr 15, 2004 at 09:10 UTC ( #345335=note: print w/replies, xml ) Need Help??

in reply to Re: Re: Re: Re: Re: Perl Internals: Hashes
in thread Perl Internals: Hashes

Well, flyingmoose i dont think our views are that dischordant. But I would like to point out and inconsistancy in what you are saying: You are preaching to the choir here in terms of what to use in real-life projects. and you start to lose edge when passing lots of data around, and you also lose the grasp on having to "rewire" graphs due to the seeming niceness of memory management.. To me the latter is about real-life projects. An algorithms and data structures class, unless it is specifically addressing the issue of large scale data processing shouldn't be dealing with huge amounts of data. Nor should it be dealing with distracting machine and OS specific issues like memory management (unless the course is directly looking at memory allocation algorithms).

With regards to your comments about pointers, Im sorry but I have to say that now you are talking about doing algorithms in C, which is indeed a good thing to know, but is entirely seperate from the issue of teaching algorithms and datastructures. A classic example is Knuth's AofP books and the fact the code is in an assembly for a computer that has never existed. And anyway, outside of pointer arithmetic what can one do with pointers that one cant do in Perl with references or with straight forward base variables?

I have to say while I agree with most of what you are saying, you arent in my eyes talking about a datastructures and algorithms class but really a whole mixture of general programming and more specifically C programming skils. Which I never commented on. I only said that in my mind teching algorithms and datastructures is just as easy if not easier in perl than in other languages. It seems that most of what you mention as positive from using other languages has actually nothing to do with learning the algorithms at hand but rather the broader set of programming skills. I agree the latter is necessary, but I dont know that it is necessary to occur simultaneously with learning complex algorithms. :-)

Anyway, I think that a course that explained algorithms in perl, and then required a reimplementation in an another language would be very useful. Perl to get the ideas crystallized in your head without other nonsense distracting from the issues, and the other language to show how drammatically an algorithm can change in appearance because of a different set of operating constraints.

Anyway, i suspect we are a bit at cross purposes here, so lets just have a beer. ;-)


    First they ignore you, then they laugh at you, then they fight you, then you win.
    -- Gandhi

Replies are listed 'Best First'.
Re: Re: Re: Re: Re: Re: Re: Perl Internals: Hashes
by flyingmoose (Priest) on Apr 15, 2004 at 18:41 UTC
    Yup, we're just nibbling around semantics...

    Anyway, i suspect we are a bit at cross purposes here, so lets just have a beer. ;-)

    What style of beer do you propose? I could go for a Harpoon IPA or maybe a Newcastle. Please discuss your views on the subject. This thread could continue for like eighty billion pages at least. ;)

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://345335]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others romping around the Monastery: (3)
As of 2018-07-18 22:34 GMT
Find Nodes?
    Voting Booth?
    It has been suggested to rename Perl 6 in order to boost its marketing potential. Which name would you prefer?

    Results (397 votes). Check out past polls.