Janice Lichtman - Restricted Array assignment

[J-C-L]

Restricted Array

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 length method? Provide justification.	Time complexity of the length method is linear, O(n), because each element in the array is visited once.
What is the space complexity of the length method? Provide justification.	Space complexity of the length method is constant, O(1), because only a single variable counter is used, and therefore the additional storage needed does not depend on the length of the array.
What is the time complexity of the print_array method? Provide justification.	Time complexity of the print_array method is linear, O(n), because each element in the array is visited once.
What is the space complexity of the print_array method? Provide justification.	Space complexity of the print_array method is constant, O(1), because only a single variable counter is used, and therefore the additional storage needed does not depend on the length of the array.
What is the time complexity of the reverse method? Provide justification.	Time complexity of the reverse method is linear, O(n), because each element in the array is visited at most once.
What is the space complexity of the reverse method? Provide justification.	Space complexity of the reverse method is constant, O(1), because the additional storage needed does not depend on the length of the array.
What is the time complexity of the search method? Provide justification.	Time complexity of the search method is linear, O(n), because each element in the array is visited at most once.
What is the space complexity of the search method? Provide justification.	Space complexity of the search method is constant, O(1), because the additional storage needed does not depend on the length of the array.
What is the time complexity of the delete method? Provide justification.	Time complexity of the delete method is linear, O(n), because each element in the array is visited once.
What is the space complexity of the delete method? Provide justification.	Space complexity of the delete method is constant, O(1), because the additional storage needed does not depend on the length of the array.
What is the time complexity of the empty method? Provide justification.	Time complexity of the empty method is linear, O(n), because each element in the array is visited once.
What is the space complexity of the empty method? Provide justification.	Space complexity of the empty method is constant, O(1), because the additional storage needed does not depend on the length of the array.
What is the time complexity of the find_largest method? Provide justification.	Time complexity of the find_largest method is linear, O(n), because each element in the array is visited once.
What is the space complexity of the find_largest method? Provide justification.	Space complexity of the find_largest method is constant, O(1), because the additional storage needed does not depend on the length of the array.
What is the time complexity of the insert_ascending method? Provide justification.	Time complexity of the insert_ascending method is linear, O(n), because each element in the array is visited once.
What is the space complexity of the insert_ascending method? Provide justification.	Space complexity of the insert_ascending method is constant, O(1), because the additional storage needed does not depend on the length of the array.

[shrutivanw]

👍 Nice work! :-)