Anibel - Reverse Sentence - Edges

[anibelamerica]

The time complexity for this reverse_sentence implementation is linear or O(n), where n equals the length of the array. The time complexity is linear since it it using a combination of 2 methods in succession, both of which run in O(n) time. The first method, reverses the words in the sentence (time complexity of O(n), space complexity of O(1)) and the second method reverses the entire string (time complexity of O(n), space complexity of O(1)). Since both methods are used in succession, the time complexity is O(2*n) but since we drop constants, it is O(n).

The space complexity of the method is constant of O(1) for similar reasons as above. The helper methods both allocate space to hold 3 integers each, regardless of input size. Thus, the reverse_sentence method has a constant space complexity as it uses up space in the cache for 6 integers regardless of input size.

[shrutivanw]

Nice work! 👍

Good job explaining the time and space complexity.