This preview shows page 1. Sign up to view the full content.
Unformatted text preview: % function output = slowSort(A) index = 1 x = 1 while index <= length(A) output = if A(index) < A(index + 1) & output(index) = A(x) x = x + 1 end index = index + 1 A = output end end...
View Full Document
This note was uploaded on 07/06/2009 for the course CS 1371 taught by Professor Stallworth during the Fall '08 term at Georgia Institute of Technology.
- Fall '08