Selection Sort in Javascript Comparing each with the rest and swapping if greater ones are found. Time Complexity Best: Ω(n^2) Average: θ(n^2) Worst: O(n^2) function selectionSort(arr){ let min; let i; let j; let temp; console.log("Input Array"); console.log(arr); for (i = 0; i < arr.length-1; i++) { min = i; for (j = i+1; j < arr.length; j++) { console.log(arr[i], arr[j]); if (arr[j] < arr[min]) { console.log(arr[j]); min = j; } } if (min !== i) { temp = arr[min]; arr[min] = arr[i]; arr[i] = temp; console.log(arr); } } console.log("Sorted using Selection Sort"); return arr } console.log(selectionSort([5,7,6,9,8,2,1,4,3])); // console.log(selectionSort([1,2,3,4,5,6,7,8,9])); // uncomment to try best case, i.e. sorted Run the live code here: https://repl.it/@VinitKhandelwal/selection-sort-javascript
Project Weekay | Resume | LinkedIn Profile
NodeJS, AWS, MongoDB, ReactJS, Django, Python, ML with Scikit Learn, Matplotlib, Seaborn
Engineering, UX, Marketing, Product Designing, Business
sayhellotovinit@gmail.com | +91 99239 08880 | Pune, India