in reply to Algorithms, Datastructures and syntax

My personal fundemntal problem with this argument is that we have made very simple things way to complex. Is this not a perl site... isn't that the fundemental idea about the langage? I personally like the 1000 1001 1011 1001 1101 argument. Take it for what it is and tell your friend to have another beer. The machine is stupid, so it comes down to a big tape and a reader... however to the smart man its control and states in a finite environment. You are all right... ok, and that is that... Next topic.
  • Comment on Re: Algorithms, Datastructures and syntax

Replies are listed 'Best First'.
Re: Re: Algorithms, Datastructures and syntax
by spiderman (Monk) on Apr 07, 2003 at 23:04 UTC
    Just to throw my 2 cents in. I think you are complicating this far more then necessary. Here are a couple of definitions I like from the National Institute of Standards and Technology. DATA STRUCTURE: Definition: An organization of information, usually in memory, for better algorithm efficiency, such as queue, stack, linked list, heap, dictionary, and tree, or conceptual unity, such as the name and address of a person. It may include redundant information, such as length of the list or number of nodes in a subtree. Note: Most data structures have associated algorithms to perform operations, such as search, insert, or balance, that maintain the properties of the data structure. ALGORITHM: Definition: A computable set of steps to achieve a desired result. Note: The word comes from the Persian author Abu Ja'far Mohammed ibn Mūsā al-Khowārizmī who wrote a book with arithmetic rules dating from about 825 A.D. http://www.nist.gov/dads/ -spiderman