Add Merge Sort page

nayakrujul · Jan 29, 2024 · 85415d1 · 85415d1
1 parent 73ca7bf
commit 85415d1
Show file tree

Hide file tree

Showing 4 changed files with 75 additions and 0 deletions.
diff --git a/CompSci/1-07-Bubble-Sort/index.html b/CompSci/1-07-Bubble-Sort/index.html
@@ -75,6 +75,11 @@ <h3 class="home-link"><a href="../">Computer Science Revision</a></h3>
             </el>
         </p>
 
+        <br />
+
+        <a class="next-link" href="../1-08-Merge-Sort/">Next: 1.08 - Merge Sort</a>
+
+        <br /> <br />
         <br /> <br />
 
         <div id="sub">© Rujul Nayak <el id="year">2024-</el></div>

diff --git a/CompSci/1-08-Merge-Sort/diagram1.png b/CompSci/1-08-Merge-Sort/diagram1.png
diff --git a/CompSci/1-08-Merge-Sort/index.html b/CompSci/1-08-Merge-Sort/index.html
@@ -0,0 +1,69 @@
+<!DOCTYPE html>
+
+<html>
+    <head>
+        <link rel="stylesheet" href="../../main.css">
+        <link rel="stylesheet" href="../main.css">
+
+        <title>Computer Science Revision</title>
+
+        <link rel="icon" type="image/png" href="../icons/logo.svg"/>
+        <meta property="og:image" content="../icons/logo.svg" />
+        <meta property="og:image:width" content="256" />
+        <meta property="og:image:height" content="256" />
+
+        <meta name="viewport" content="width=device-width, initial-scale=1.0">
+        <meta name="description" content="1.08 - Merge Sort | Computer Science Revision">
+    </head>
+
+    <body>
+        <h1>1.08 &ndash; Merge Sort</h1>
+        <h3 class="home-link"><a href="../">Computer Science Revision</a></h3>
+        <br />
+
+        <a class="prev-link" href="../1-07-Bubble-Sort/">Previous: 1.07 - Bubble Sort</a>
+        <br /> <br />
+
+        <p class="definition">
+            <img src="../icons/book.svg" class="icon" />
+            <strong>Merge sort</strong> is a more complicated sorting algorithm.
+        </p>
+
+        <p>
+            The steps to do a merge sort are as follows:
+            <br /> &emsp; 1. Keep splitting the list in half until all sublists contain one item
+            <br /> &emsp; 2. Repeatedly merge and sort pairs of sublists into larger sublists
+            <br /> &emsp; 3. Eventually, the whole list will be reconstructed in order
+        </p>
+
+        <p>
+            Diagram 1 shows an example run of merge sort on a list of numbers.
+        </p>
+
+        <p class="diagram">
+            <img src="../icons/image.svg" class="icon" />
+            Diagram 1 <br /> <br />
+            <img src="./diagram1.png" width="300px" />
+        </p>
+
+        <p class="question">
+            <img src="../icons/question.svg" class="icon" />
+            Which sorting algorithm is more efficient: merge sort or bubble sort?
+        </p>
+
+        <p class="spoiler noselect">
+            <el class="default">Tap/click to reveal</el>
+            <el class="answer">
+                Merge sort (with a worst case <b>time complexity</b> on the order of <code>O(n log n)</code>) is much more efficient than
+                bubble sort (worst case on the order of <code>O(n<sup>2</sup>)</code>), especially for larger lists.
+            </el>
+        </p>
+
+        <br /> <br />
+
+        <div id="sub">© Rujul Nayak <el id="year">2024-</el></div>
+        <script src="../../year.js"></script>
+
+        <script src="../spoilers.js"></script>
+    </body>
+</html>
diff --git a/CompSci/index.html b/CompSci/index.html
@@ -30,6 +30,7 @@ <h3><strong>Chapter 1 - Algorithms</strong></h3>
             <li><a href="./1-05-Binary-Search/">1.05 - Binary Search</a></li>
             <li><a href="./1-06-Searching-Algorithms-Comparison/">1.06 - Searching Algorithms Comparison</a></li>
             <li><a href="./1-07-Bubble-Sort/">1.07 - Bubble Sort</a></li>
+            <li><a href="./1-08-Merge-Sort/">1.08 - Merge Sort</a></li>
         </ul>
 
         <div id="sub">© Rujul Nayak <el id="year">2024-</el></div>