1
/* -*- Mode: JavaScript; coding: utf-8; tab-width: 3; indent-tabs-mode: tab; c-basic-offset: 3 -*-
2
*******************************************************************************
4
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
6
* Copyright create3000, Scheffelstraße 31a, Leipzig, Germany 2011.
8
* All rights reserved. Holger Seelig <holger.seelig@yahoo.de>.
10
* The copyright notice above does not evidence any actual of intended
11
* publication of such source code, and is an unpublished work by create3000.
12
* This material contains CONFIDENTIAL INFORMATION that is the property of
15
* No permission is granted to copy, distribute, or create derivative works from
16
* the contents of this software, in whole or in part, without the prior written
17
* permission of create3000.
19
* NON-MILITARY USE ONLY
21
* All create3000 software are effectively free software with a non-military use
22
* restriction. It is free. Well commented source is provided. You may reuse the
23
* source in any way you please with the exception anything that uses it must be
24
* marked to indicate is contains 'non-military use only' components.
26
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
28
* Copyright 2015, 2016 Holger Seelig <holger.seelig@yahoo.de>.
30
* This file is part of the Cobweb Project.
32
* Cobweb is free software: you can redistribute it and/or modify it under the
33
* terms of the GNU General Public License version 3 only, as published by the
34
* Free Software Foundation.
36
* Cobweb is distributed in the hope that it will be useful, but WITHOUT ANY
37
* WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR
38
* A PARTICULAR PURPOSE. See the GNU General Public License version 3 for more
39
* details (a copy is included in the LICENSE file that accompanied this code).
41
* You should have received a copy of the GNU General Public License version 3
42
* along with Cobweb. If not, see <http://www.gnu.org/licenses/gpl.html> for a
43
* copy of the GPLv3 License.
45
* For Silvio, Joy and Adi.
47
******************************************************************************/
54
function MergeSort (array, compare)
57
this .auxiliary = [ ];
60
this .compare = compare;
63
MergeSort .prototype =
65
compare: function (lhs, rhs)
69
sort: function (first, last)
71
this .mergeSort (first, last - 1);
73
mergeSort: function (lo, hi)
77
var m = (lo + hi) >>> 1;
78
this .mergeSort (lo, m); // Recursion
79
this .mergeSort (m + 1, hi); // Recursion
80
this .merge (lo, m, hi);
83
merge: function (lo, m, hi)
88
// Copy first half of array a to auxiliary array b.
90
this .auxiliary [i++] = this .array [j++];
93
// Copy back next-greatest element at each time.
94
while (k < j && j <= hi)
96
if (this .compare (this .array [j], this .auxiliary [i]))
97
this .array [k++] = this .array [j++];
99
this .array [k++] = this .auxiliary [i++];
102
// Copy back remaining elements of first half (if any).
104
this .array [k++] = this .auxiliary [i++];