Branches - Emily Ball

[eaball35]

Sorting & Reverse Sentence

Question	Answer
Describe how Bubble Sort works	Bubble sort compares each value, bubbling up the max value to the top of the list. Once the max is at the top, the list shrinks by one and iterates through again continuing to bubble the max value to the top each time until the list is ordered.
Describe how Selection Sort works	Selection sort works by working with a sorted and unsorted portion of the list. Each iteration you find the minimum value in the unsorted portion and add it to the beginning of the sorted list until the entire list is sorted.
Describe how Insertion sort works	Insertion sort works by comparing each element to value and inserting that value into its correct position in "sorted" portion of list. Each time it iterates the list of unsorted values shrinks until all elements are sorted
Which Sorting Algorithm has the best time complexity?	Merge Sort or other more complicated algorithm

[CheezItMan]

As you noted it's not reversing in place. It's also using the = sign to change my_sentence and it has problems with the tests. You do have a good sort. Take a look at my comments and let me know if you have questions.

[CheezItMan]

Gotcha

[CheezItMan]

Note my lesson in how functions work This won't change the argument. So the tests are failing.

[CheezItMan]

Nice insertion sort.

[CheezItMan]

Technically this has space complexity of O(n) since you do .split

[CheezItMan]

Why are these commented out? Made me wonder what was up.