Algorithm: sort(a, b, c, d)
if a > b then swap(a, b)
if c > d then swap(c, d)
if a > c then swap(a, c)
if b > d then swap(b, d)
if b > c then swap(b, c)
subroutine: swap(x, y)
temp <- x
x <- y
y <- temp
The resulting sequence a, b, c, d will be sorted in ascending order.
Tuesday, August 9, 2011
How to sort four numbers in 5 comparisons? Efficiency in terms of space, time and number of assignments is not considered.
Labels:
4 numbers,
sort,
sort 4 numbers in 5 comparisons
Location:
Fairfield, IA, USA
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment