Danielle Birbal - Restricted-Array

[birbalds]

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.	O(n) because every element of the array is visited once
What is the space complexity of the length method? Provide justification.	Constant because only a int variable is used
What is the time complexity of the print_array method? Provide justification.	O(n) because every element of the array is visited once
What is the space complexity of the print_array method? Provide justification.	Constant because only a int variable is used
What is the time complexity of the reverse method? Provide justification.	O(n) because every element of the array is visited once
What is the space complexity of the reverse method? Provide justification.	Constant because only variables were used
What is the time complexity of the search method? Provide justification.	O(n) because it can take visiting each element of the array once to get a result
What is the space complexity of the search method? Provide justification.	Constant because no extra space needed
What is the time complexity of the delete method? Provide justification.	O(n) because every element is potentially visited once
What is the space complexity of the delete method? Provide justification.	Constant because no extra space is used
What is the time complexity of the empty method? Provide justification.	O(n) because every element is visited
What is the space complexity of the empty method? Provide justification.	Constant because no extra space is used
What is the time complexity of the find_largest method? Provide justification.	O(n) because every element is visited once
What is the space complexity of the find_largest method? Provide justification.	Constant because only variables were used
What is the time complexity of the insert_ascending method? Provide justification.	O(n) because every element is visited only once
What is the space complexity of the insert_ascending method? Provide justification.	Constant because only variables were used

[shrutivanw]

This should be comparison instead of assignment. i.e. if array[i] == value_to_find and not if array[i] = value_to_find, which will always be true.

[shrutivanw]

Nicely done!

Apart from the minor bug in search (This should be comparison instead of assignment. i.e. if array[i] == value_to_find and not if array[i] = value_to_find, which will always be true.), the rest looks good.