http://www.perlmonks.org?node_id=248077

I've been having a "debate" with one of my friends upon the nature of many computer fundamentals. His basic premise is that datastructures are the same as algorithsm, both of which are specific to a language. (My premise, is of course, the correct one =] ). A concrete example of this, is his arguement that a "for loop" in ASM would be considered a data structure. Can someone please shed some light here, perhaps with slightly more authoritive sources?