3
Contributors
2
Replies
3
Views
7 Years
Discussion Span
Last Post by eggmatters
1

Anyone know what Algorithm Verification implies?:-/

To make sure the algorithm is a valid solution to your problem. Type code based on your algorithm to see if the algorithm actually works in a real program. If it doesnt work, the algorithm is flawed and must be re-written.

Votes + Comments
N/A
you forgot about top-posting, ya fascist
0

To make sure the algorithm is a valid solution to your problem. Type code based on your algorithm to see if the algorithm actually works in a real program. If it doesnt work, the algorithm is flawed and must be re-written.

Also, more formally, an algorithm must satisfy 2 sets of conditions. Inital conditions and final conditions. The set of initial condtions may be null. There must be one member of the set of final conditions. An algorithm is a well-formed set of n-procedures that satisfies the final condtions. For example, we have an algrorithm:

Count to 3. 
initial conditions: none
final conditions: number 3 is reached:
steps:
   initialize count to 0;
   increment count;
   is count equal to 3?
   if yes STOP
   if no, go to step 1

Very trivial, very easy to validate, but it helps to think about these things formally as you continue further into CS.

This topic has been dead for over six months. Start a new discussion instead.
Have something to contribute to this discussion? Please be thoughtful, detailed and courteous, and be sure to adhere to our posting rules.