Leaves - Mariya Burrows

[M-Burr]

Sorting & Reverse Sentence

Question	Answer
Describe how Bubble Sort works	Bubble sort works by comparing the values at neighboring/adjacent index position and swaps them such that the larger value gets pushed to the right (i.e., towards the end of the array). After the first iteration, the largest value will get pushed to the last index position; the second-to-largest value will be pushed to the second to last index position in the second iteration, and so forth.
Describe how Selection Sort works	At first iteration, It searches through the entire array and finds the smallest value and inserts it at index 0. In the second iteration, it finds the second smallest value and places it in the next index position (i.e., index 1). Each iteration through the array compares from its current index position through the end of the array (i.e., not the elements at index positions which have already been sorted).
Describe how Insertion sort works	It examines each index, one at a time, and the examined side is considered sorted. When examining the next (unsorted) index position, it inserts that element in the proper place of the sorted side of the array.
Which Sorting Algorithm has the best time complexity?	Merge sort has the best time complexity of O(nlogn).

[CheezItMan]

Nice work, you hit the learning goals here. Check out my comments and let me know if you have any questions.

[CheezItMan]

Actually since start_position jumps to the end of the reversed word after a reversal, this is O(n)

[CheezItMan]

I would say O(m) where m is the number of words, but yet. Could you instead do this with O(1) space complexity?

[CheezItMan]

This is an interesting sort, it's not one of the standard sorts but does sort elements. It does work however.

[CheezItMan]

yup