Addie's Linked List

[add2point71dots]

Linked Lists

Congratulations! You're submitting your assignment.

Comprehension Questions

What is the time and space complexity for each method you implemented? Provide justification.

Question	Answer
What is the time complexity of the insert method? Provide justification.	O(1) because I'm just replacing the head no matter the size of the list.
What is the space complexity of the insert method? Provide justification.	O(1) because I'm only creating one new node, no matter the size of the list.
What is the time complexity of the search method? Provide justification.	O(n) because I'm stepping through the list once.
What is the space complexity of the search method? Provide justification.	O(1) because I'm not creating anything that depends on the size of the list.
What is the time complexity of the find_max method? Provide justification.	O(n) because I'm stepping through the list once.
What is the space complexity of the find_max method? Provide justification.	O(1) because I'm not creating anything that depends on the size of the list.
What is the time complexity of the find_min method? Provide justification.	O(n) because I'm stepping through the list once.
What is the space complexity of the find_min method? Provide justification.	O(1) because I'm not creating anything that depends on the size of the list.
What is the time complexity of the length method? Provide justification.	O(n) because I'm stepping through the list once.
What is the space complexity of the length method? Provide justification.	O(1) because I'm not creating anything that depends on the size of the list.
What is the time complexity of the find_nth_from_beginning method? Provide justification.	O(n) because I'm stepping through the list n times.
What is the space complexity of the find_nth_from_beginning method? Provide justification.	O(1) because I'm not creating anything that depends on n.
What is the time complexity of the insert_ascending method? Provide justification.	O(n) because I'm stepping through the list once.
What is the space complexity of the insert_ascending method? Provide justification.	O(1) because I'm not creating anything that depends on the size of the input.
What is the time complexity of the visit method? Provide justification.	O(n) because I'm stepping through the list once to print each element.
What is the space complexity of the visit method? Provide justification.	O(1) because I'm not storing anything that depends on the size of the list.
What is the time complexity of the delete method? Provide justification.	O(n) because I'm (potentially) stepping through the list once.
What is the space complexity of the delete method? Provide justification.	O(1) because I'm not creating anything that depends on the size of the input.
What is the time complexity of the reverse method? Provide justification.	O(n) because I'm stepping through the list once to reverse it.
What is the space complexity of the reverse method? Provide justification.	O(1) because I'm just creating temporary variables that do not depend on the size of the list.
What is the time complexity of the find_middle_value method? Provide justification.	O(n) because I'm stepping through the array once with one pointer and through half with the other.
What is the space complexity of the find_middle_value method? Provide justification.	O(1) because I'm not creating anything that depends on the size of the input.
What is the time complexity of the find_nth_from_end method? Provide justification.	O(n) because I'm stepping through once, albeit with two pointers.
What is the space complexity of the find_nth_from_end method? Provide justification.	O(1) because I'm not creating anything that depends on the size of the input.
What is the time complexity of the has_cycle method? Provide justification.	O(n). While it might cycle through part of the list more than once, there are no nested loops. I'm just using two pointers to individually step through the list.
What is the space complexity of the has_cycle method? Provide justification.	O(1) because I'm not creating anything dependent on the size of the input.

[shrutivanw]

Nice work!

And now I know a little bit of Go, thanks to you. :-) It looks similar to C.