Update cs3003-unit4-examples.md.html

added bubble and quicksort

Author: kgashok

notes/cs3003-unit4-examples.md.html

@@ -592,12 +592,20 @@ <h1 id="epilogue">Epilogue</h1>
 <h2 id="verbose-compare">Verbose Compare</h2>
 <p><img src="http://bit.ly/sortVerbose" alt="verbose"></p>
 <h2 id="python-pseudo-code-compare">Python Pseudo Code Compare</h2>
+<p><strong>UPDATE: May 30, 2022</strong><br>
+<em>Added bubblesort (for AD3251)</em><br>
+<img src="https://i.imgur.com/wXqaMty.png" alt="bubble"></p>
 <ul>
 <li>insertionsort : get a key and <strong>insert</strong> it into <em>sorted</em> sublist</li>
 <li>selectionsort : <strong>select</strong> minimum value and swap into <em>sorted</em> sublist</li>
 <li>mergesort :  divide and <strong>merge</strong> (<em>conquer</em>) of <em>sorted</em> sublists</li>
 </ul>
 <p><img src="http://bit.ly/sortCompared2" alt="sortCode"></p>
+<p><strong>UPDATE: May 30, 2022</strong><br>
+<em>Added quicksort (for AD3251)</em><br>
+<img src="https://i.imgur.com/dGztZZe.png" alt="qsort"></p>
+<p>With the <code>partition</code> function:<br>
+<img src="https://i.imgur.com/1LVSfeW.png" alt="qsort2"></p>
 <h2 id="helper-functions">Helper functions</h2>
 <p>Three helper functions (<code>insort</code>, <code>min_index</code> and <code>merge</code>) were written and used in the respective sorting implementation.</p>
 <p>These helper functions are very effective in capturing the core of each of the algorithm. Also, they help in presenting the algorithm in an incremental fashion, reducing the cognitive load on the student.</p>