This preview shows page 1. Sign up to view the full content.
Unformatted text preview: dent of the programming language used to implement the algorithm. Proper$es of Algorithms ༉ Input: an algorithm has input values from a speciﬁed set. ༉ Output: from the input values, the algorithm produces the output values from a speciﬁed set. The output values are the solution. ༉ Correctness: an algorithm should produce the correct output values for each set of input values. ༉ Finiteness: an algorithm should produce the output after a ﬁnite number of steps for any input. ༉ Eﬀectiveness: it must be possible to perform each step of the algorithm correctly and in a ﬁnite amount of time. ༉ Generality: the algorithm should work for all problems of the desired form. Finding the Max Element in a set ༉ Th...
View
Full
Document
This document was uploaded on 02/27/2014 for the course CS 215 at SIU Carbondale.
 Spring '14
 M.Nojoumian
 Algorithms, Sort

Click to edit the document details