Homework Solution: Q 1. Prove that the statement:…

    Q 1. Prove that the statement: If (a>b) then swap(a, b) else null; arranges a and b in non-decreasing order. Q 2. (Challenge) Prove that the statements: If (a>b) then swap(a, b) else null; If (b>c) then swap(b, c) else null; If (a>b) then swap(a, b) else null; arrange a, b and c in non-decreasing order.

    Expert Answer

    Q 1. Prove that the statement:

    If (a>b) then swap(a, b) else null;

    arranges a and b in non-decreasing classify.

    Q 2. (Challenge) Prove that the statements:

    If (a>b) then swap(a, b) else null;

    If (b>c) then swap(b, c) else null;

    If (a>b) then swap(a, b) else null;

    arrange a, b and c in non-decreasing classify.

    Expert Retort