This project demonstrates a simple implementation of the Number Sort algorithm in JavaScript. The algorithm repeatedly compares adjacent elements in an array and swaps them if they are in the wrong order, resulting in a sorted array.
the following line to test with a different sorting algorithm Change the assigned value of sortedValue to the algorithm you want to use/test [ bubbleSort, selectionSort, insertionSort] or use the in=bulit sort method that is currently commented out
This project is open-source and available under the MIT License.