Merge pull request #8 from anasmak04/master

sort an array without functions

Author: mehediislamripon

README.md

@@ -47,6 +47,7 @@
 | Problem - 43 | [ Fibonacci ](https://github.com/anasmak04/Problem-solving-with-JavaScript/blob/master/problem-43.js) |
 | Problem - 44 | [ swap ](https://github.com/anasmak04/Problem-solving-with-JavaScript/blob/master/problem-44.js) |
 | Problem - 45 | [ max two numbers ](https://github.com/anasmak04/Problem-solving-with-JavaScript/blob/master/problem-45.js) |
+| Problem - 46 | [ Sort an Array without using any built-in functions ](https://github.com/anasmak04/Problem-solving-with-JavaScript/blob/master/problem-46.js) |
 
 
-<!-- | Problem - 46 | | -->
+<!-- | Problem - 47 | | -->

problem-46.js

@@ -0,0 +1,19 @@
+// Sort an Array You must solve the problem without using any built-in functions
+let sortArray = function(nums) {
+ let swapp
+ do {
+ swapp = false
+ for (let i = 0; i < nums.length; i++) {
+ if (nums[i] > nums[i + 1]) {
+ let temp = nums[i];
+ nums[i] = nums[i + 1];
+ nums[i + 1] = temp;
+ swapp = true
+ }
+ }
+ } while (swapp);
+ return nums 
+};
+
+
+console.log(sortArray([5,9,2,-1,3,-126])) // [-126 , -1 , 2 ,3 , 5 , 9]