Skip to content

feat/merge-sort merge sort implement #16

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.

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

Merged
merged 1 commit into from
Sep 18, 2022
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
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
35 changes: 35 additions & 0 deletions javascript-today-magazine/merge-sort.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,35 @@
/**
* Merge sort
*/
var __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {
if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
if (ar || !(i in from)) {
if (!ar) ar = Array.prototype.slice.call(from, 0, i);
ar[i] = from[i];
}
}
return to.concat(ar || Array.prototype.slice.call(from));
};
function mergeSort(array) {
if (array.length === 1) {
return array;
}
var center = Math.floor(array.length / 2);
var left = array.slice(0, center);
var right = array.slice(center);
return merge(mergeSort(left), mergeSort(right));
}
function merge(left, right) {
var results = [];
while (left.length && right.length) {
if (left[0] < right[0]) {
results.push(left.shift());
}
else {
results.push(right.shift());
}
}
return __spreadArray(__spreadArray(__spreadArray([], results, true), left, true), right, true);
}
var mergeArray = [3, 4, 6, 9, 3, 1];
console.log(mergeSort(mergeArray));
30 changes: 30 additions & 0 deletions javascript-today-magazine/merge-sort.ts
Original file line number Diff line number Diff line change
@@ -0,0 +1,30 @@
/**
* Merge sort
*/

type props = number[];

function mergeSort(array: props): (number| undefined)[] | any {
if (array.length === 1) {
return array;
}
const center: number = Math.floor(array.length / 2);
const left: number[] = array.slice(0, center);
const right: number[] = array.slice(center);
return merge(mergeSort(left), mergeSort(right));
}

function merge(left: number[], right: number[]) {
const results: (number| undefined)[] = [];
while (left.length && right.length) {
if (left[0] < right[0]) {
results.push(left.shift());
} else {
results.push(right.shift());
}
}
return [...results, ...left, ...right];
}

const mergeArray = [3, 4, 6, 9, 3, 1];
console.log(mergeSort(mergeArray));