Leaves - Yitgop

[rinostar]

Sorting & Reverse Sentence

Question	Answer
Describe how Bubble Sort works	Going through an unordered list, compare and swap neighbor elements if needed, until the whole list is sorted in ascending order.
Describe how Selection Sort works	Find the smallest element of an unordered list and place it in the beginning of the list, then find the smallest element of the remaining list and place it in the beginning of the remaining list, and so on until reached the end of the whole list.
Describe how Insertion sort works	Starting from the beginning of an unordered list, compare the new element to its left and place it in the correct location in the left, until reached the end of the whole list - same as how we would sort our cards when playing poker.
Which Sorting Algorithm has the best time complexity?	All of these sorting algorithm has a O(n^2) time complexity. When n is small, insertion sort works better on average. However, when n starts to get bigger, we should start to use O(nlogn) sorting algorithm like Merge sort and Quick sort

[CheezItMan]

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

[CheezItMan]

I don't think this method is really needed as dividing an odd length by 2 will automatically round down.

[CheezItMan]

Notice that you're reversing a couple of times in this method. Could you instead make a helper method. That would dry this out.

[CheezItMan]

Correct where n is the number of words.

[CheezItMan]

Nice bubblesort