adding comments
This commit is contained in:
@@ -54,6 +54,8 @@ $ ./a.out
|
|||||||
|
|
||||||
**To complete this checkpoint**, explain to a TA your implementation and show the output of your program.
|
**To complete this checkpoint**, explain to a TA your implementation and show the output of your program.
|
||||||
|
|
||||||
|
<!--TODO: how about memory leaks?-->
|
||||||
|
|
||||||
<!--## Checkpoint 3: Debugging a Merge Sort program.
|
<!--## Checkpoint 3: Debugging a Merge Sort program.
|
||||||
*estimate: 30-40 minutes*
|
*estimate: 30-40 minutes*
|
||||||
|
|
||||||
|
|||||||
@@ -12,6 +12,7 @@ public:
|
|||||||
};
|
};
|
||||||
|
|
||||||
// function to merge two sorted doubly linked lists
|
// function to merge two sorted doubly linked lists
|
||||||
|
// this function returns a pointer pointing to the head node of the merged list.
|
||||||
template <class T>
|
template <class T>
|
||||||
Node<T>* mergeLists(Node<T>* head_A, Node<T>* head_B) {
|
Node<T>* mergeLists(Node<T>* head_A, Node<T>* head_B) {
|
||||||
}
|
}
|
||||||
|
|||||||
Reference in New Issue
Block a user