Add files via upload

ShivamMaurya2002 · web-flow · commit 25f9e4ad29f6 · 2025-07-21T17:29:05.000+05:30
diff --git a/JS/Sort Without sort.html b/JS/Sort Without sort.html
@@ -0,0 +1,88 @@
+<!DOCTYPE html>
+<html lang="en">
+<head>
+    <meta charset="UTF-8">
+    <meta name="viewport" content="width=device-width, initial-scale=1.0">
+    <title>Sort an Array Without Using sort()</title>
+    <style>
+        body {
+            line-height: 1.3;
+            font-size: 16px;
+            margin: 20px;
+            background-color: #eaedf0;
+        }
+        pre {
+            background-color: #dbdfe3;
+            padding: 15px;
+            border-radius: 5px;
+            overflow-x: auto;
+        }
+        code {
+            color: #000000;
+        }
+        h1, h2 {
+            color: #343a40;
+        }
+        h3 {
+            color: #495057;
+        }
+        .example {
+            color: #f52222;
+        }
+    </style>
+</head>
+<body>
+    <h1>Sort an Array Without Using <code>sort()</code></h1>
+    <p>
+        Sorting an array without using JavaScript's built-in <code>sort()</code> method can be done using simple techniques like the bubble sort algorithm.
+    </p>
+
+    <h2>Using Bubble Sort</h2>
+    <p>
+        Below is an example of sorting an array in ascending order using the bubble sort algorithm:
+    </p>
+    <pre><code>
+function bubbleSort(arr) {
+    let n = arr.length;
+    for (let i = 0; i < n - 1; i++) 
+    {
+        for (let j = 0; j < n - i - 1; j++)
+         {
+            if (arr[j] > arr[j + 1]) 
+            {
+                let temp = arr[j];
+                arr[j] = arr[j + 1];
+                arr[j + 1] = temp;
+            }
+        }
+    }
+    return arr;
+}
+const numbers = [5, 3, 8, 1, 2];
+const sortedArray = bubbleSort(numbers);
+console.log(sortedArray); 
+    </code></pre>
+    <p class="example">Output: [1, 2, 3, 5, 8]</p>
+
+    <h2>How It Works</h2>
+    <p>
+        - Bubble sort works by repeatedly comparing adjacent elements and swapping them if they are in the wrong order.<br>
+        - This process is repeated until the entire array is sorted.<br>
+        - For the array <code>[5, 3, 8, 1, 2]</code>:
+        <ul>
+            <li>In the first pass, the largest number is moved to the last position.</li>
+            <li>This continues until all elements are in ascending order.</li>
+        </ul>
+    </p>
+
+    <h2>Why Bubble Sort?</h2>
+    <p>
+        While bubble sort is not the most efficient sorting algorithm, it is easy to understand and implement, making it a great choice for learning purposes.
+    </p>
+
+    <h2>Conclusion</h2>
+    <p>
+        Sorting an array without <code>sort()</code> can be achieved using algorithms like bubble sort. This method is simple but may not be suitable for very large datasets.
+    </p>
+</body>
+</html>
