Discovering Algorithms with Matrix Code

Details Discovering Algorithms with Matrix Code Discovering Algorithms with Matrix Code

2012-03-11

arxiv.org/abs/1203.2296v1

Computer Science

Programming Languages

9 pages, 7 figures

Scientific paper

In first-year programming courses it is often difficult to show students how an algorithm can be discovered. In this paper we present a program format that supports the development from specification to code in small and obvious steps; that is, a discovery process. The format, called Matrix Code, can be interpreted as a proof according to the Floyd-Hoare program verification method. The process consists of expressing the specification of a function body as an initial code matrix, growing the matrix by adding rows and columns until the completed matrix is translated in a routine fashion to compilable code. As worked example we develop a Java program that generates the table of the first N prime numbers.

Affiliated with

Also associated with

No associations

Rating

Discovering Algorithms with Matrix Code does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Discovering Algorithms with Matrix Code, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Discovering Algorithms with Matrix Code will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-14358