Unformatted text preview: 3. Establish the correctness or incorrectness of the following program segment. The commands of the following proof outline could be used to find the smallest value in an array. {( ∀ j 0 ≤ j ≤ i1 : x ≤ b[j])} if x ≤ b[i] → skip & x ≥ b[i] → x:= b[i] fi; i:= i+ 1 {( ∀ j 0 ≤ j ≤ i1 : x ≤ b[j])}...
View
Full
Document
This note was uploaded on 03/19/2008 for the course CS 336 taught by Professor Myers during the Spring '08 term at University of Texas.
 Spring '08
 Myers

Click to edit the document details