Javascript - manual sorting

Question

There is an unfinished sorting function, which should find the minimum element of the array and insert it into the new array. Since I don’t know how to remove the previous minimum element, the function returns an array from the minimal number itself from the given array (for example [44, 5, 2, 6, 3] it gives [2, 2, 2, 2, 2] , instead of [2, 3, 5, 6, 44] )

I need to add / correct the code below, not a new or abbreviated version. I want to understand how it works through functions and cycles, how many I have not tried in different ways - all in vain:

 function sort(arr) { var sorted = []; var min = Infinity; for (j = 0; j < arr.length; j++) { for (var i = 0; i < arr.length; i++) { if (arr[i] < min ) { min = arr[i]; } } sorted.push(min); } return sorted; }

If any of the answers led you to a decision, you should mark it as true - a green check mark to the left of the answer.

vadru vadru 96 2 · Accepted Answer · 2017-02-25T23:11:33

The code in question is not optimal, to put it mildly, but it can be “fixed”)

 function sort(arr) { var sorted = []; var min = Infinity; var minIndex = Infinity; for (j = 0; j < arr.length; j++) { for (var i = 0; i < arr.length; i++) { if (arr[i] < min ) { min = arr[i]; minIndex = i;// нужен предполагаемый индекс минимума кроме самого минимума, чтобы убрать его из исходного массива } } arr[minIndex] = Infinity;// исходный массив надо поправить, в нем нет больше "найденного минимального элемента, поставим бесконечность, чтобы была больше любого" sorted.push(min); min = Infinity;// надо сбрасывать минимум, иначе в следующей итерации не найдем ничего меньше, либо инициализиировать переменную внутри первого for } return sorted; }

Lukas pierce lukas pierce 537 2 eight · Answer 2 · 2017-02-17T19:03:01

 var mins = []; //сюда будем записывать минимумы //массив массивов var arr = [ [10, 1, 5, 3, 6], [65, 21, 45, 32, 16], [300, 20, 25, 78, 6015], ]; var absMin = arr[0][0]; //мимимум по всем строкам for (var i = 0; i < arr.length; i++) { var row = arr[i]; //поиск минимума в строке var min = row[0]; for (var j = 0; j < row.length; j++) { var num = row[j]; if (num < min) min = num; if (num < absMin) absMin = num; } mins.push(min); } document.write('Минимальные элементы в каждой строке:<br> [' + mins.join(', ') + ']'); document.write('<hr>'); document.write('Абсолютный мимимум:<br>' + absMin);

Demonstration of work here https://codepen.io/lukas-pierce/pen/MJdmWm

You misunderstood me, I need to get [2, 3, 5, 6, 44] from [44, 5, 2, 6, 3], but thanks for your code, it will be interesting to understand it!

Lukas pierce lukas pierce 537 2 eight · Answer 3 · 2017-02-17T19:16:49

Immediately did not understand the problem statement:

 var nums = [44, 5, 2, 6, 3]; nums.sort(function(a, b){ return a - b; }); document.write('[' + nums.join(', ') + ']');

working example here https://codepen.io/lukas-pierce/pen/jyomyB

Sorry, but this is also not what I need, I want to write the sort function myself, as in the code I threw, only there a couple of lines are not enough to remove the previous minimum numbers

Answer 4 · 2017-02-17T20:23:52

So what?

 console.info([44, 5, 2, 6, 3].sort((a, b) => a > b));

No need to create a bike in this case.
It will be slow (relatively native implementation) and difficult to maintain.

But still:

 let arr = [44, 5, 2, 6, 3]; const sort = a => { let len = a.length - 1; // Проход каждому элементу for(let i = 0; i < len; i++) // Проводим элемент по массиву for(var e = 0; e < len - i; e++) // Если элемент больше следующего if(a[e] > a[e + 1]) // То флипаем его (меняем местами) [a[e], a[e + 1]] = [a[e + 1], a[e]]; return a; }; console.info(sort(arr));

this is a bit wrong, I want not to change their places, but to create a new array, look for the smallest number, push it into a new array, for example [44, 5, 2, 6, 3] find 2, push, delete 2 and 3 now we’re minimal, we are looking for it, pushing and so on, but I don’t know how to delete the previous minimum number
@SeerPauka, It seems you yourself do not understand what you want.
After pushing, the numbers again become faceless in this context.

Lukas pierce lukas pierce 537 2 eight · Answer 5 · 2017-02-18T05:30:57

 <textarea rows="5" name="source" placeholder="Введите элементы массива через запятую">44, 5, 2, 6, 3</textarea> <br> <button name="do_sort">Выполнить сортировку</button> <br> <br> <h2>Результат</h2> <textarea rows="5" name="result"></textarea> <script> var btn = document.querySelector('button[name="do_sort"]'), source = document.querySelector('textarea[name="source"]'), result = document.querySelector('textarea[name="result"]'); btn.onclick = function() { try { var arr = JSON.parse("[" + source.value + "]"); result.value = BubbleSort(arr).join(', '); } catch (e) { alert("Ошибка в исходных данных"); } }; /** сортировка методом пузырька * @param A - массив, который нужно отсортировать по возрастанию */ function BubbleSort(A) { var n = A.length; for (var i = 0; i < n - 1; i++) { for (var j = 0; j < n - 1 - i; j++) { if (A[j + 1] < A[j]) { var t = A[j + 1]; A[j + 1] = A[j]; A[j] = t; } } } return A; // На выходе сортированный по возрастанию массив A. } </script>

Link to working example https://codepen.io/lukas-pierce/pen/EZzEEx

Javascript - manual sorting

5 answers 5

More articles: