From 3c60ebdf179b3e64b2c1445643a38e5529321b04 Mon Sep 17 00:00:00 2001 From: Jidong Xiao Date: Tue, 20 Feb 2024 01:52:18 -0500 Subject: [PATCH] about the hardcoding --- labs/07_list_implementation/README.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/labs/07_list_implementation/README.md b/labs/07_list_implementation/README.md index ffe4198..381335b 100644 --- a/labs/07_list_implementation/README.md +++ b/labs/07_list_implementation/README.md @@ -32,14 +32,14 @@ Linked List of NodeA nodes: 1 -> 2 -> 3 -> 4 -> 5 -> nullptr Linked List of NodeB nodes: 1 -> 1.41421 -> 1.73205 -> 2 -> 2.23607 -> nullptr ``` -**Note**: Hardcoding the PrintList() function to just print the above two messages is strictly prohibited. Students doing that will be evicted from the lab room. Also, your functions must be templated functions. +**Note**: Hardcoding the PrintList() function to just print the above two messages is strictly prohibited. Also, your functions must be templated functions. **To complete this checkpoint**, show a TA the implementation and the output of your program. ## Checkpoint 3: Merge Two Lists. *estimate: 30-40 minutes* -Given two doubly-linked lists: linked list A and linked list B, and both linked lists are sorted. Data in linked list A is sorted in an ascending order. Data in linked list B is also sorted in an ascending order. Merge these two lists such that the data in the merged list is still sorted in an ascending order. +Given two doubly-linked lists: linked list A and linked list B, and both linked lists are sorted. Data in linked list A is sorted in an ascending order. Data in linked list B is also sorted in an ascending order. Merge these two lists such that data in the merged list is still sorted in an ascending order. More specifically, complete the mergeLists() function in [checkpoint3.cpp](checkpoint3.cpp), such that the program prints the following output.