On Ground Sorting University of Virginia在地面上排序弗吉尼亚大学.pptVIP

25 February 2004 CS 200 Spring 2004 David Evans /evans Menu Mutation Primitives Programming with Mutation PS 5 Evaluation Rule 2: Names If the expression is a name, it evaluates to the value associated with that name. Names and Places A name is not just a value, it is a place for storing a value. define creates a new place, associates a name with that place, and stores a value in that place Bang! set! (“set bang”) changes the value associated with a place set! should make you nervous Defining nextx Evaluation Rules set-car! and set-cdr! (set-car! p v) Replaces the car of the cons p with v. (set-cdr! p v) Replaces the cdr of the cons p with v. Functional Programming Programming without mutation Side-effects like printing and drawing on the screen are really mutations (of the display, printer, bell, etc.) If an expression has a value, it is always the same – order of evaluation doesn’t matter Substitution model of evaluation works fine Imperative Programming Programming with mutation (assignment) Value of an expression might be different depending on when it is evaluated Substitution model of evaluation doesn’t work anymore! Why Substitution Fails? Why would a programming language allow mutation? Does it allow us to express computations we couldn’t express without it? No! We can express all computations without mutation. (We’ll see why before the end of the course…) Mutation allows us to express some computations more naturally and efficiently But it also makes everything else more complicated map Functional Solution: A procedure that takes a procedure of one argument and a list, and returns a list of the results produced by applying the procedure to each element in the list. Imperative Solution A procedure that takes a procedure and list as arguments, and replaces each element in the list with the value of the procedure applied to that element. Programming with Mutation PS5: Databases Database is tables of fields containing values Commands for insertin