2618 - EECS2310_Lab

#	Problem	Pass Rate (passed user / total user)
13661	EECS2310_Lab_6_1
13662	EECS2310_Lab_6_2

13661 - EECS2310_Lab_6_1

Status | Limits Submit

	Time	Memory
Case 1	1 sec	32 MB
Case 2	1 sec	32 MB
Case 3	1 sec	32 MB
Case 4	1 sec	32 MB

Description

Input

Output

Sample Input Download

8
1 2 3 4 5 6 7 8
7 8 5 6 3 4 1 2
4 3 2 1 8 7 6 5
6 5 8 7 2 1 4 3
8 7 6 5 4 3 2 1
2 1 4 3 6 5 8 7
5 6 7 8 1 2 3 4
3 4 1 2 7 8 5 6

Sample Output Download

yes

13662 - EECS2310_Lab_6_2

Status | Limits Submit

	Time	Memory
Case 1	1 sec	32 MB
Case 2	1 sec	32 MB

Description

Implement the Merge operation. Read this first

http://homepages.math.uic.edu/~leon/cs-mcs401-r07/handouts/mergesort.pdf (English)

https://alrightchiu.github.io/SecondRound/comparison-sort-merge-sorthe-bing-pai-xu-fa.html (Chinese)

Ignore the Mergesort for now. Just focus on Merge. Do not use any sorting algorithm to implement this function. You will get no points for that. Your I/O format should be adjusted accordingly according to what we explained in the class (or what's said in the videoclip).

Input

5
4 19 23 38 56
6
1 5 38 42 59 63

Output

11
1 4 5 19 23 38 38 42 56 59 63