July 6


<p><font size="2" color="green"><LI>
Lab work for Monday July 3 (L6): Implement <a href="mergesort.ppt"> Mergesort.</a> Print  the c array in the merge routine to show
 the elements after getting merged. Implement the Bubble sort  algorithm given in the notes, but modify it so that instead of making
n-1
passes, it terminates when the array gets fully sorted . Print the array values  after every pass. Use a sample array of 10 
elements.
<p><font size="4" color="brown"><LI> Homework 2 posted.
</p>