Skip to content

Сортировка слияниями #18

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Сортировка слияниями #18

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
13 changes: 13 additions & 0 deletions hw1.htm
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,13 @@
<!DOCTYPE html>
<html>
<head>
<meta charset="utf-8">
<title>HomeWork </title>
<!--<link rel="stylesheet" href="qunit/qunit-1.10.0.css">-->
</head>
<body onload="main('-10,7,10,15,13,-13,6,5')">
<div id="qunit"></div>
<!--<script src="qunit/qunit-1.10.0.js"></script>-->
<script src="hw1.js"></script>
</body>
</html>
59 changes: 59 additions & 0 deletions hw1.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,59 @@
function merge(array, leftBorder, split, rightBorder) {
"use strict";
var MAX = 100000,
position1 = split - leftBorder + 1,
position2 = rightBorder - split,
tempArr1 = [],
tempArr2 = [],
i,
j,
k;
tempArr1.length = position1 + 1;
tempArr2.length = position2 + 1;
tempArr1[position1] = MAX;
tempArr2[position2] = MAX;
for (i = 0; i < position1; i = i + 1) {
tempArr1[i] = array[leftBorder + i];
}
for (i = 0; i < position2; i = i + 1) {
tempArr2[i] = array[split + i + 1];
}
i = 0;
j = 0;
for (k = leftBorder; k <= rightBorder; k = k + 1) {
if (tempArr1[i] <= tempArr2[j]) {
array[k] = tempArr1[i];
i = i + 1;
} else {
array[k] = tempArr2[j];
j = j + 1;
}
}
}

function mergeSort(array, leftBorder, rightBorder) {
"use strict";
if (leftBorder < rightBorder) {
var split = Math.floor((leftBorder + rightBorder) / 2);
mergeSort(array, leftBorder, split);
mergeSort(array, split + 1, rightBorder);
merge(array, leftBorder, split, rightBorder);
}
}

function draw(array) {
"use strict";
console.log(array);
}

function main(myArg) {
"use strict";
draw(myArg);
var array = myArg.split(','),
i = 0;
for (i; i < array.length; i = i + 1) {
array[i] = parseInt(array[i], 10);
}
mergeSort(array, 0, array.length - 1);
draw(array);
}