<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Code Software on Chris McKelt - Remembering Thoughts</title><link>https://blog.smarttechventures.au/tags/code-software/</link><description>Recent content in Code Software on Chris McKelt - Remembering Thoughts</description><generator>Hugo -- 0.147.2</generator><language>en</language><lastBuildDate>Sun, 08 Mar 2009 00:00:00 +0800</lastBuildDate><atom:link href="https://blog.smarttechventures.au/tags/code-software/index.xml" rel="self" type="application/rss+xml"/><item><title>Design Principles</title><link>https://blog.smarttechventures.au/articles/posts/design-principles/</link><pubDate>Sun, 08 Mar 2009 00:00:00 +0800</pubDate><guid>https://blog.smarttechventures.au/articles/posts/design-principles/</guid><description>SOLID</description></item><item><title>Sorting Algorithms</title><link>https://blog.smarttechventures.au/articles/posts/sorting-algorithms/</link><pubDate>Thu, 05 Mar 2009 00:00:00 +0800</pubDate><guid>https://blog.smarttechventures.au/articles/posts/sorting-algorithms/</guid><description>&lt;ul>
&lt;li>Bubble&lt;/li>
&lt;li>Heap&lt;/li>
&lt;li>Insertion&lt;/li>
&lt;li>Merge&lt;/li>
&lt;li>Quick&lt;/li>
&lt;li>Selection&lt;/li>
&lt;li>Shell&lt;/li>
&lt;/ul>
&lt;h1 id="which-sorting-algorithm-has-the-best-asymptotic-runtime-complexity">Which sorting algorithm has the best asymptotic runtime complexity?&lt;/h1>
&lt;p>&lt;strong>Heap Sort&lt;/strong>&lt;/p>
&lt;p>&lt;img alt="628e6d48b76004a4afb95ae28aa2328e" loading="lazy" src="https://user-images.githubusercontent.com/662868/120915766-3509c380-c6d8-11eb-8c96-a4c99e4fd423.png">&lt;/p></description></item></channel></rss>