From 5eb5e3942b3f0bd9dea01fe511232ebefb49c509 Mon Sep 17 00:00:00 2001
From: AkshatPandey <akshatpandey26.2004@gmail.com>
Date: Tue, 16 Jul 2024 15:40:01 +0530
Subject: [PATCH] minor changes

---
 index.html  | 20 ++++++++++----------
 visual.html | 47 +++++++++++++++++++++++++++++++++++++++++++++++
 2 files changed, 57 insertions(+), 10 deletions(-)

diff --git a/index.html b/index.html
index 3ff6a77..6b72629 100644
--- a/index.html
+++ b/index.html
@@ -432,7 +432,15 @@ <h3><a href="visual.html">Bubble Sort</a></h3>
                   compares adjacent elements, and swaps them if they are out of order.  </p>
                 </div>
             </div>
-
+            <div class="course bg-white h-100 align-self-stretch">
+              <figure class="m-0">
+                <a href="visual.html"><img src="images/radix-sort.webp" alt="Image" class="img-fluid"></a>
+              </figure>
+              <div class="course-inner-text py-4 px-4">
+                <h3><a href="visual.html">Radix Sort</a></h3>
+                <p>Radix Sort is a non-comparative sorting algorithm that sorts numbers by processing individual digits. </p>
+              </div>
+            </div>
             <div class="course bg-white h-100 align-self-stretch">
               <figure class="m-0">
                 <a href="visual.html"><img src="images/merge.png" alt="Image" class="img-fluid"></a>
@@ -493,15 +501,7 @@ <h3><a href="visual.html">Heap Sort</a></h3>
                 <p>Heap sort is a comparison-based sorting algorithm that builds a max heap from the input data and repeatedly extracts the maximum element to sort the array.
               </div>
             </div>
-            <div class="course bg-white h-100 align-self-stretch">
-              <figure class="m-0">
-                <a href="visual.html"><img src="images/radix-sort.webp" alt="Image" class="img-fluid"></a>
-              </figure>
-              <div class="course-inner-text py-4 px-4">
-                <h3><a href="visual.html">Radix Sort</a></h3>
-                <p>Radix Sort is a non-comparative sorting algorithm that sorts numbers by processing individual digits. </p>
-              </div>
-            </div>
+            
             <div class="course bg-white h-100 align-self-stretch">
               <figure class="m-0">
                 <a href="Compare.html"><img src="images/compare.png" alt="Image" class="img-fluid"></a>
diff --git a/visual.html b/visual.html
index 4e2c143..18262c9 100644
--- a/visual.html
+++ b/visual.html
@@ -327,6 +327,7 @@ <h1 id="heading">Sorting Algorithms Visualization</h1>
                 <option value="merge">Merge Sort</option>
                 <option value="heap">Heap Sort</option>
                 <option value="quick">Quick Sort</option>
+                <option value="radix">Radix Sort</option>
             </select>
             <button id="start" class="btn-primary" onclick="startSort()">Start Sort</button>
             <button class="btn-primary" onclick="stop = true; stopClicked()">Stop</button>
@@ -625,6 +626,49 @@ <h3 id="tourTitle"></h3>
             await swap(i + 1, high);
             return i + 1;
         }
+        function getMax(arr) {
+    let max = arr[0];
+    for (let i = 1; i < arr.length; i++) {
+        if (arr[i] > max) {
+            max = arr[i];
+        }
+    }
+    return max;
+}
+
+// Function to count sort based on the digit represented by exp
+async function countSort(arr, exp) {
+    let output = new Array(arr.length);
+    let count = new Array(10).fill(0);
+
+    for (let i = 0; i < arr.length; i++) {
+        count[Math.floor(arr[i] / exp) % 10]++;
+    }
+
+    for (let i = 1; i < 10; i++) {
+        count[i] += count[i - 1];
+    }
+
+    for (let i = arr.length - 1; i >= 0; i--) {
+        output[count[Math.floor(arr[i] / exp) % 10] - 1] = arr[i];
+        count[Math.floor(arr[i] / exp) % 10]--;
+    }
+
+    for (let i = 0; i < arr.length; i++) {
+        arr[i] = output[i];
+        await updateSingleBar(i);
+    }
+}
+
+// Function to implement Radix Sort
+async function radixSort() {
+    let m = getMax(array);
+
+    for (let exp = 1; Math.floor(m / exp) > 0; exp *= 10) {
+        await countSort(array, exp);
+        if (stop) return;
+    }
+}
 
         async function highlightBars(indices, className) {
             indices.forEach(index => {
@@ -697,6 +741,9 @@ <h3 id="tourTitle"></h3>
                 case "quick":
                     await quickSort();
                     break;
+                case "radix":
+                    await radixSort();
+                    break;
             }
             enableSubmitButton();
         }