Branches - Diana Han

[dhan0406]

Sorting & Reverse Sentence

Question	Answer
Describe how Bubble Sort works	Bubble sort works by traversing the array and comparing the adjacent elements and swapping them if they are out of order.
Describe how Selection Sort works	Selection sort works by selecting the smallest unsorted item and then swapping it with the value at index 0. Then, it finds the second smallest and place it at index 1.
Describe how Insertion sort works	Insertion sort works by looking at each element and inserting it into its proper place. First it assumes that the first element is sorted and it finds the next value to compare to the sorted value and then it shifts over any elements to make space for the value being added. Finally it inserts the value into the sorted subset and this repeats until the whole array is sorted.
Which Sorting Algorithm has the best time complexity?	Insertion sort, bubble sort, and selection sort all have the time complexity of O(n^2).

[CheezItMan]

Not bad, you didn't get reverse_sentence in place, but otherwise this works well. Take a look at my comments and let me know if you have questions.

[CheezItMan]

This is making another array causing O(n) space complexity. You were asked to do the reverse in place.

[CheezItMan]

Nice bubblesort

[CheezItMan]

Correct