CSE 130 1-29-10 Lecture 3

Published on: Sat Jan 30 2010

This was a general overview of good practices. The first important note was to think with Time Efficiency. The professor pointed out how there are two ways to “sum to N”. One is to keep adding 1 each time until you each N, the other way is to use the Gaussian Summation Formula. While the Gaussian Summation Formula was something I had not heard of before, the point of the assignment was really to teach us about the assignment of an expression to a variable Assignment Statement Ex: sum = ( n* (n+1) )/2 Control Statement Decide who does the work Summary of Programs Problem Solving Process Tips Algorithm building blocks