// Welcome alert("Welcome, if you like please give +1 else -1. To check algorithms please look js section. I am working on a ui for selecting algorithm to run and show its bigO") // Searching Algorithms // Linear Search function lineSearch(arr, num) { let req = -1; for (let i = 0; i < arr.length; i++) { if (arr[i] == num) { req = i; } } return req; } // Binary Search function binSearch(arr, num) { let start = 0; let end = arr.length - 1; let middle = Math.floor((start + end) / 2); while (arr[middle] != num && start <= end) { if (num < arr[middle]) end = middle - 1; else start = middle + 1; middle = Math.floor((start + end) / 2); } return num == arr[middle] ? middle : -1; } // Sorting Algorithms // Bubble Sort function buubleSort(arr) { let noSwaps; for (let i = arr.length; i > 0; i--) { noSwaps = true; for (let j = 0; j < i - 1; j++) { if (arr[j] > arr[j + 1]) { [arr[j], arr[j + 1]] = [arr[j + 1], arr[j]]; noSwaps = false; } } if (noSwaps) break; } return arr; } // Selection Sort function selectionSort(arr) { for (let i = 0; i < arr.length; i++) { let lowest = i; for (let j = i + 1; j < arr.length; j++) { if (arr[lowest] > arr[j]) { lowest = j; } } if (i !== lowest) [arr[i], arr[lowest]] = [arr[lowest], arr[i]]; } return arr; } // Insertion Sort function insertionSort(arr) { for (let i = 1; i < arr.length; i++) { for (let j = i - 1; j >= 0 && arr[j] > arr[j + 1]; j--) { [arr[j + 1], arr[j]] = [arr[j], arr[j + 1]]; } } return arr; } // Merge Sort function merge(arr1, arr2) { let results = []; let i = 0; let j = 0; while (i < arr1.length && j < arr2.length) { if (arr2[j] > arr1[i]) { results.push(arr1[i]); i++; } else { results.push(arr2[j]); j++; } } while (i < arr1.length) { results.push(arr1[i]); i++; } while (j < arr2.length) { results.push(arr2[j]); j++; } return results; } function mergeSort(arr) { if (arr.length <= 1) return arr; let mid = Math.floor(arr.length / 2); let left = mergeSort(arr.slice(0, mid)); let right = mergeSort(arr.slice(mid)); return merge(left, right); } // Quick Sort function pivot(arr, start = 0, end = arr.length - 1) { const swap = (arr, idx1, idx2) => { [arr[idx1], arr[idx2]] = [arr[idx2], arr[idx1]]; }; let pivot = arr[start]; let swapIdx = start; for (let i = start + 1; i <= end; i++) { if (pivot > arr[i]) { swapIdx++; swap(arr, swapIdx, i); } } swap(arr, start, swapIdx); return swapIdx; } function quickSort(arr, left = 0, right = arr.length - 1) { if (left < right) { let pivotIndex = pivot(arr, left, right); quickSort(arr, left, pivotIndex - 1); quickSort(arr, pivotIndex + 1, right); } return arr; } // Radix Sort function getDigit(num, i) { return Math.floor(Math.abs(num) / Math.pow(10, i)) % 10; } function digitCount(num) { if (num === 0) return 1; return Math.floor(Math.log10(Math.abs(num))) + 1; } function mostDigits(nums) { let maxDigits = 0; for (let i = 0; i < nums.length; i++) { maxDigits = Math.max(maxDigits, digitCount(nums[i])); } return maxDigits; } function radixSort(nums) { let maxDigitCount = mostDigits(nums); for (let k = 0; k < maxDigitCount; k++) { let digitBuckets = Array.from({ length: 10 }, () => []); for (let i = 0; i < nums.length; i++) { let digit = getDigit(nums[i], k); digitBuckets[digit].push(nums[i]); } nums = [].concat(...digitBuckets); } return nums; } // Outputing // Input let array = prompt("Type A Unsorted Number Array"); let number = prompt("Type A Number In Given Array"); if(typeof(Number(number)) == "number" && array != ""){ try { array = JSON.parse(array); number = Number(number); } catch(err) {} } // Run if(typeof(array) == "object" && typeof(number) == "number"){ alert("Index Of Given Number Using Linear Search - " + lineSearch(array, number)); alert("Index Of Given Number Using Binary Search - " + binSearch(array, number)); alert("Sorted Array With Bubble Sort - " + buubleSort(array)); alert("Sorted Array With Selection Sort - " + selectionSort(array)); alert("Sorted Array With InsertionSort Sort - " + insertionSort(array)); alert("Sorted Array With Merge Sort - " + mergeSort(array)); alert("Sorted Array With Quick Sort - " + quickSort(array)); alert("Sorted Array With Radix Sort - " + radixSort(array)); }else{ alert("You are not given valid array or number or both") }

Javascript Algorithms