A Prove That Any Comparisonbased Algorithm To Sort 4 Elements

a. Prove that any comparison-based algorithm to sort 4 elements requires 5 comparisons.
b. Give an algorithm to sort 4 elements in 5 comparisons.

Posted in Uncategorized