Raisah V

[raisahv]

Sorting & Reverse Sentence

Question	Answer
Describe how Bubble Sort works	Bubble Sort goes through an array and looks at adjacent elements. If elements are out of order, they are swapped to be in order. During the first iteration, the element with the largest value is moved to the end of the array, so during the following iterations you can reduce the number of elements you are looking at by 1, because you no longer need to iterate through the last few elements of the array.
Describe how Selection Sort works	Selection Sort searches an array for a minimum value and swaps the minimum value with the value at index of 0. With each iteration, Selection Sort finds the next smallest value in the array and swaps the value with the value at the next smallest index. During each iteration you can reduce the number of elements you are looking at by 1, because you no longer need to iterate through the first few elements in the array.
Describe how Insertion Sort works	Insertion Sort divides an array between a portion that is sorted and a portion that is unsorted. Insertion Sort moves through an array to place items into the sorted portion of the array. During the first iteration, Insertion Sort compares values at index 0 and index 1 to find which is smallest. If the value at index 1 is smallest, you swap the values at index 0 and at index 1. During the second iteration you compare values at index 2 and index 1. If the value at index 2 is smaller than the value at index 1, the values are swapped. If the new value at index 1 is smaller than the value at index 0, the values are swapped again.
Which Sorting Algorithm has the best time complexity?	Merge Sort has the best time complexity of O(nlogn). Bubble sort, Selection sort and Insertion sort all have time complexity O(n^2).

[CheezItMan]

Nice work, check out my comments and let me know if you have any questions.

[CheezItMan]

This is actually O(n) since word_start in the outer loop jumps to the end of a word after it reverses that word.

[CheezItMan]

Notice that you're reversing things twice in this method. Could you dry things up by making a helper method?

[CheezItMan]

The time complexity is O(n²). Look at the nested loops

Otherwise nice selection sort.