leaves- Natalie Tapias

[NatalieTapias]

Sorting & Reverse Sentence

Question	Answer
Describe how Bubble Sort works	Bubble sort steps through the list to be sorted and compares adjacent items, swapping them if they are in the wrong order. The algorithm continues this process until it is all the way through the list.
Describe how Selection Sort works	Selection sort looks through the entire array for the smallest element, then swaps with the first element in the array. Then look for smallest element in the remaining part of the unsorted section of the array and place it in the second position. Then compare the first and second elements and swap if necessary. Continue in the same fashion for the third element until the end of the array.
Describe how Insertion sort works	Insertion sort inserts each item into its proper place.
Which Sorting Algorithm has the best time complexity?	Merge sort has the best time complexity, with O(n log n)

[CheezItMan]

This solves the problems, but you are not reversing the sentence in place. Consider parsing the string character-by-character and first reversing the whole string, then reversing each word using a modified version of your reversaroo method.

[CheezItMan]

Yes since you're doing .split it creates a new array, and you create a temp array.

You were asked to reverse the words in place.

[CheezItMan]

Could this method be extended with a start and end index to reverse a substring in place?

[CheezItMan]

O(n)

[CheezItMan]

O(n)

[CheezItMan]

O(m * w) where m is the number of words and w the length of the words.

[CheezItMan]

O(m)

[CheezItMan]

The time complexity is not O(n³).

Instead you have:

O(n + n + m * w + m)

Since you will have relatively fewer words than letters (where n is the number of letters), and most words will be short, you could say this is O(n) time complexity.