1+ <!DOCTYPE html>
2+ < html lang ="en ">
3+ < head >
4+ < meta charset ="utf-8 ">
5+ < title > JSDoc: Module: sorting/mergesort/merge</ title >
6+
7+ < script src ="scripts/prettify/prettify.js "> </ script >
8+ < script src ="scripts/prettify/lang-css.js "> </ script >
9+ <!--[if lt IE 9]>
10+ <script src="//html5shiv.googlecode.com/svn/trunk/html5.js"></script>
11+ <![endif]-->
12+ < link type ="text/css " rel ="stylesheet " href ="styles/prettify-tomorrow.css ">
13+ < link type ="text/css " rel ="stylesheet " href ="styles/jsdoc-default.css ">
14+ </ head >
15+
16+ < body >
17+
18+ < div id ="main ">
19+
20+ < h1 class ="page-title "> Module: sorting/mergesort/merge</ h1 >
21+
22+
23+
24+
25+
26+
27+ < section >
28+
29+ < header >
30+
31+
32+
33+
34+
35+ </ header >
36+
37+ < article >
38+ < div class ="container-overview ">
39+
40+
41+ < div class ="description "> Devides and sort merges two subarrays of given array</ div >
42+
43+
44+
45+
46+
47+
48+
49+
50+
51+
52+
53+
54+
55+
56+
57+ < h5 > Parameters:</ h5 >
58+
59+
60+ < table class ="params ">
61+ < thead >
62+ < tr >
63+
64+ < th > Name</ th >
65+
66+
67+ < th > Type</ th >
68+
69+
70+
71+
72+
73+ < th class ="last "> Description</ th >
74+ </ tr >
75+ </ thead >
76+
77+ < tbody >
78+
79+
80+ < tr >
81+
82+ < td class ="name "> < code > array</ code > </ td >
83+
84+
85+ < td class ="type ">
86+
87+
88+ < span class ="param-type "> array</ span >
89+
90+
91+
92+ </ td >
93+
94+
95+
96+
97+
98+ < td class ="description last "> The array which subarrays should be sorted</ td >
99+ </ tr >
100+
101+
102+
103+ < tr >
104+
105+ < td class ="name "> < code > start</ code > </ td >
106+
107+
108+ < td class ="type ">
109+
110+
111+ < span class ="param-type "> number</ span >
112+
113+
114+
115+ </ td >
116+
117+
118+
119+
120+
121+ < td class ="description last "> The start of the first subarray.
122+ This subarray is with end middle - 1.</ td >
123+ </ tr >
124+
125+
126+
127+ < tr >
128+
129+ < td class ="name "> < code > middle</ code > </ td >
130+
131+
132+ < td class ="type ">
133+
134+
135+ < span class ="param-type "> number</ span >
136+
137+
138+
139+ </ td >
140+
141+
142+
143+
144+
145+ < td class ="description last "> The start of the second array</ td >
146+ </ tr >
147+
148+
149+
150+ < tr >
151+
152+ < td class ="name "> < code > end</ code > </ td >
153+
154+
155+ < td class ="type ">
156+
157+
158+ < span class ="param-type "> number</ span >
159+
160+
161+
162+ </ td >
163+
164+
165+
166+
167+
168+ < td class ="description last "> end - 1 is the end of the second array</ td >
169+ </ tr >
170+
171+
172+ </ tbody >
173+ </ table >
174+
175+
176+
177+
178+
179+ < dl class ="details ">
180+
181+
182+
183+
184+
185+
186+
187+
188+
189+
190+
191+
192+
193+
194+
195+
196+
197+
198+
199+
200+
201+
202+
203+
204+
205+
206+ < dt class ="tag-source "> Source:</ dt >
207+ < dd class ="tag-source "> < ul class ="dummy "> < li >
208+ < a href ="sorting_mergesort.js.html "> sorting/mergesort.js</ a > , < a href ="sorting_mergesort.js.html#line37 "> line 37</ a >
209+ </ li > </ ul > </ dd >
210+
211+
212+
213+
214+
215+
216+
217+ </ dl >
218+
219+
220+
221+
222+
223+
224+
225+
226+
227+
228+
229+
230+
231+ < h5 > Returns:</ h5 >
232+
233+
234+ < div class ="param-desc ">
235+ The array with sorted subarray
236+ </ div >
237+
238+
239+
240+ < dl >
241+ < dt >
242+ Type
243+ </ dt >
244+ < dd >
245+
246+ < span class ="param-type "> array</ span >
247+
248+
249+ </ dd >
250+ </ dl >
251+
252+
253+
254+
255+
256+
257+
258+ </ div >
259+
260+
261+
262+
263+
264+
265+
266+
267+
268+
269+
270+
271+
272+
273+
274+
275+
276+
277+ </ article >
278+
279+ </ section >
280+
281+
282+
283+
284+ </ div >
285+
286+ < nav >
287+ < h2 > < a href ="index.html "> Home</ a > </ h2 > < h3 > Modules</ h3 > < ul > < li > < a href ="module-combinatorics_cartesianproduct.html "> combinatorics/cartesianproduct</ a > </ li > < li > < a href ="module-combinatorics_combinations.html "> combinatorics/combinations</ a > </ li > < li > < a href ="module-combinatorics_permutations.html "> combinatorics/permutations</ a > </ li > < li > < a href ="module-combinatorics_variations-repetition.html "> combinatorics/variations-repetition</ a > </ li > < li > < a href ="module-data-structures_binary-search-tree.html "> data-structures/binary-search-tree</ a > </ li > < li > < a href ="module-data-structures_heap.html "> data-structures/heap</ a > </ li > < li > < a href ="module-data-structures_interval-tree.html "> data-structures/interval-tree</ a > </ li > < li > < a href ="module-data-structures_linked-list.html "> data-structures/linked-list</ a > </ li > < li > < a href ="module-data-structures_red-black-tree.html "> data-structures/red-black-tree</ a > </ li > < li > < a href ="module-graphs_others_topological-sort.html "> graphs/others/topological-sort</ a > </ li > < li > < a href ="module-graphs_searching_bfs.html "> graphs/searching/bfs</ a > </ li > < li > < a href ="module-graphs_searching_dfs.html "> graphs/searching/dfs</ a > </ li > < li > < a href ="module-graphs_shortest-path_bellman-ford.html "> graphs/shortest-path/bellman-ford</ a > </ li > < li > < a href ="module-graphs_shortest-path_dijkstra.html "> graphs/shortest-path/dijkstra</ a > </ li > < li > < a href ="module-graphs_shortest-path_floyd-warshall.html "> graphs/shortest-path/floyd-warshall</ a > </ li > < li > < a href ="module-graphs_spanning-trees_prim.html "> graphs/spanning-trees/prim</ a > </ li > < li > < a href ="module-others_hanoi.html "> others/hanoi</ a > </ li > < li > < a href ="module-others_levenshtein-distance.html "> others/levenshtein-distance</ a > </ li > < li > < a href ="module-primes_is-prime.html "> primes/is-prime</ a > </ li > < li > < a href ="module-primes_prime-factor-tree.html "> primes/prime-factor-tree</ a > </ li > < li > < a href ="module-primes_sieve-of-eratosthenes.html "> primes/sieve-of-eratosthenes</ a > </ li > < li > < a href ="module-searching_binarysearch.html "> searching/binarysearch</ a > </ li > < li > < a href ="module-searching_knuth-morris-pratt.html "> searching/knuth-morris-pratt</ a > </ li > < li > < a href ="module-searching_longest-increasing-subsequence.html "> searching/longest-increasing-subsequence</ a > </ li > < li > < a href ="module-searching_maximum-subarray.html "> searching/maximum-subarray</ a > </ li > < li > < a href ="module-searching_maximum-subarray-divide-and-conquer.html "> searching/maximum-subarray-divide-and-conquer</ a > </ li > < li > < a href ="module-searching_quickselect.html "> searching/quickselect</ a > </ li > < li > < a href ="module-searching_recursive-binarysearch.html "> searching/recursive-binarysearch</ a > </ li > < li > < a href ="module-sets_quickfind.html "> sets/quickfind</ a > </ li > < li > < a href ="module-sets_quickunion.html "> sets/quickunion</ a > </ li > < li > < a href ="module-sets_weightquickunion.html "> sets/weightquickunion</ a > </ li > < li > < a href ="module-shuffle_fisheryates.html "> shuffle/fisheryates</ a > </ li > < li > < a href ="module-shuffle_richarddurstenfeld.html "> shuffle/richarddurstenfeld</ a > </ li > < li > < a href ="module-sorting_3-way-string-quicksort.html "> sorting/3-way-string-quicksort</ a > </ li > < li > < a href ="module-sorting_bubblesort.html "> sorting/bubblesort</ a > </ li > < li > < a href ="module-sorting_bucketsort.html "> sorting/bucketsort</ a > </ li > < li > < a href ="module-sorting_countingsort.html "> sorting/countingsort</ a > </ li > < li > < a href ="module-sorting_heapsort.html "> sorting/heapsort</ a > </ li > < li > < a href ="module-sorting_insertion-binary-sort.html "> sorting/insertion-binary-sort</ a > </ li > < li > < a href ="module-sorting_insertionsort.html "> sorting/insertionsort</ a > </ li > < li > < a href ="module-sorting_lsd.html "> sorting/lsd</ a > </ li > < li > < a href ="module-sorting_mergesort.html "> sorting/mergesort</ a > </ li > < li > < a href ="module-sorting_mergesort_merge.html "> sorting/mergesort/merge</ a > </ li > < li > < a href ="module-sorting_msd.html "> sorting/msd</ a > </ li > < li > < a href ="module-sorting_quicksort-middle.html "> sorting/quicksort-middle</ a > </ li > < li > < a href ="module-sorting_recursive-insertionsort.html "> sorting/recursive-insertionsort</ a > </ li > < li > < a href ="module-sorting_selectionsort.html "> sorting/selectionsort</ a > </ li > < li > < a href ="module-sorting_shellsort.html "> sorting/shellsort</ a > </ li > </ ul > < h3 > Classes</ h3 > < ul > < li > < a href ="module-data-structures_binary-search-tree.BinaryTree.html "> BinaryTree</ a > </ li > < li > < a href ="module-data-structures_binary-search-tree.Node.html "> Node</ a > </ li > < li > < a href ="module-data-structures_heap.Heap.html "> Heap</ a > </ li > < li > < a href ="module-data-structures_interval-tree.IntervalTree.html "> IntervalTree</ a > </ li > < li > < a href ="module-data-structures_interval-tree.Node.html "> Node</ a > </ li > < li > < a href ="module-data-structures_linked-list.LinkedList.html "> LinkedList</ a > </ li > < li > < a href ="module-data-structures_linked-list.Node.html "> Node</ a > </ li > < li > < a href ="module-data-structures_red-black-tree.RBTree.html "> RBTree</ a > </ li > < li > < a href ="module-graphs_shortest-path_bellman-ford.Edge.html "> Edge</ a > </ li > < li > < a href ="module-graphs_spanning-trees_prim.Edge.html "> Edge</ a > </ li > < li > < a href ="module-graphs_spanning-trees_prim.Graph.html "> Graph</ a > </ li > < li > < a href ="module-graphs_spanning-trees_prim.Vertex.html "> Vertex</ a > </ li > < li > < a href ="module-sets_quickfind.QuickFind.html "> QuickFind</ a > </ li > < li > < a href ="module-sets_quickunion.QuickUnion.html "> QuickUnion</ a > </ li > < li > < a href ="module-sets_weightquickunion.QuickUnion.html "> QuickUnion</ a > </ li > </ ul >
288+ </ nav >
289+
290+ < br class ="clear ">
291+
292+ < footer >
293+ Documentation generated by < a href ="https://github.com/jsdoc3/jsdoc "> JSDoc 3.3.0-alpha13</ a > on Tue Jan 20 2015 00:15:01 GMT+0200 (EET)
294+ </ footer >
295+
296+ < script > prettyPrint ( ) ; </ script >
297+ < script src ="scripts/linenumber.js "> </ script >
298+ </ body >
299+ </ html >
0 commit comments