Computer Science Fundamentals (CS153 2004S)

Class 36: Arrays

Back to Building a Rational Class, Revisited. On to Designing Objects.

Held: Monday, 5 April 2004

Summary: Today we visit one of Java's core data structures: the array. We consider two applications of arrays in writing algorithms.

Related Pages:

Assignments:

Notes:

Overview:

Arrays

Arrays in Java

Example: The Fibonacci Sequence

A Recursive Implementation

Improving the Recursive Implementation

An Iterative Implementation

Another Example: Grain Packing

Box Packing with Arrays

 

History

 

Back to Building a Rational Class, Revisited. On to Designing Objects.

Disclaimer: I usually create these pages on the fly, which means that I rarely proofread them and they may contain bad grammar and incorrect details. It also means that I tend to update them regularly (see the history for more details). Feel free to contact me with any suggestions for changes.

This document was generated by Siteweaver on Fri May 7 09:43:24 2004.
The source to the document was last modified on Tue Jan 13 10:26:11 2004.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS153/2004S/Outlines/outline.36.html.

You may wish to validate this document's HTML ; Valid CSS! ; Check with Bobby

Samuel A. Rebelsky, rebelsky@grinnell.edu