def test_merge_empty():
+ a = LinkedList()
+ b = LinkedList()
+ a.sorted_ingest(b)
+
+ assert str(a) == "[]"
+ assert b.empty
+
+
+def test_merge_empty_in_single():
+ a = LinkedList()
+ a.append(1)
+ b = LinkedList()
+ a.sorted_ingest(b)
+
+ assert str(a) == "[1]"
+ assert b.empty
+
+
+def test_merge_single_in_empty():
+ a = LinkedList()
+ b = LinkedList()
+ b.append(1)
+ a.sorted_ingest(b)
+
+ assert str(a) == "[1]"
+ assert b.empty
+
+
+def test_merge_is_append():
+ a = LinkedList()
+ a.append(1)
+ a.append(2)
+ a.append(3)
+ b = LinkedList()
+ b.append(4)
+ b.append(5)
+ b.append(6)
+ a.sorted_ingest(b)
+
+ assert str(a) == "[1, 2, 3, 4, 5, 6]"
+ assert b.empty
+
+
+def test_merge_is_prepend():
+ a = LinkedList()
+ a.append(1)
+ a.append(2)
+ a.append(3)
+ b = LinkedList()
+ b.append(4)
+ b.append(5)
+ b.append(6)
+ b.sorted_ingest(a)
+
+ assert str(b) == "[1, 2, 3, 4, 5, 6]"
+ assert a.empty
+
+
+def test_merge_is_interleave():
+ a = LinkedList()
+ a.append(1)
+ a.append(3)
+ a.append(5)
+ b = LinkedList()
+ b.append(2)
+ b.append(4)
+ b.append(6)
+ b.sorted_ingest(a)
+
+ assert str(b) == "[1, 2, 3, 4, 5, 6]"
+ assert a.empty
+
+
+def test_merge_is_interleave_uneven():
+ a = LinkedList()
+ a.append(1)
+ a.append(3)
+ a.append(5)
+ a.append(10)
+ b = LinkedList()
+ b.append(2)
+ b.append(4)
+ b.append(6)
+ b.sorted_ingest(a)
+
+ assert str(b) == "[1, 2, 3, 4, 5, 6, 10]"
+ assert a.empty
+
+
+def test_merge_random():
+ a = sorted([random.randint(0, 100) for x in range(0, 10)])
+ b = sorted([random.randint(0, 100) for x in range(0, 10)])
+ c = sorted(a + b)
+
+ p = LinkedList()
+ for e in a:
+ p.append(e)
+
+ q = LinkedList()
+ for e in b:
+ q.append(e)
+
+ p.sorted_ingest(q)
+
+ for i, e in enumerate(p):
+ assert e == c[i]
+