1. Matt Salamone & Chris Addis
Algorithms
Matt Salamone & Chris Addis

2. Definition of Algorithms
Algorithm- is a series of programming instructions used for computation and information processing. It is not an entire program, merely specific logical tasks performed inside a program. There are many different algorithms you can use to complete a specific task. The goal of the programmer is to find the most efficient algorithm.

3. Algorithmic Types
Serial – Doing an algorithm on one processor.

4. Algorithmic Types
Parallel – Dividing up the algorithm’s instructions using multiple processors.

5. Algorithmic Types
Iterative - refers to itself until a condition is met, using repetitive constructs.

6. Algorithmic Types
Approximate – An algorithmic solution that is as close as possible to the real solution. Example: pi

7. Algorithm Example
max=a[0][0];
min=a[0][0];
for(i=0;i<M;i++) {
for(j=0;j<M;j++)
if (a[i][j]>max)
max=a[i][j]; }
if (a[i][j]<min)
min=a[i][j];
In this example algorithm. Using arrays, for loops and if statements you are able to determine the minimum and maximum integers in the array.

8. Quiz
3. For loops and while loops are examples of what type of algorithm?
Serial
Parallel
Iterative
Approximation
4. For the calculation of repeating fractions what type of algorithm would you use?
1. Which is the fastest method of computing data?
Serial
Parallel
Iterative
Approximation
2. What is the method of programming that we use in this class the most?

9. References
Wikipedia
Source ACM Communications in Computer Algebra archive Volume 40 ,  Issue 1  (March 2006) table of contents COLUMN: Timely communications table of contents Pages: 2 - 8   Year of Publication: 2006 ISSN: Authors Yasushi Umeda  University of Tsukuba, Tsukuba-shi, Ibaraki, Japan Tateaki Sasaki  University of Tsukuba, Tsukuba-shi, Ibaraki, Japan PublisherACM  New York, NY, USA