Leaves_Ga-Young

[gyjin]

Sorting & Reverse Sentence

Question	Answer
Describe how Bubble Sort works	Bubble sort compares each pair of adjacent items and swaps them if they are in the wrong order. The process continues until it passes through the items without needing to swap anything, at which point the items should be sorted.
Describe how Selection Sort works	Selection sort finds the smallest value among the items and swaps it with the item at index(0), then finds the next smallest item and swaps it with the item at index(1), and so on until all items are sorted.
Describe how Insertion sort works	Insertion sort takes one item at a time from the original data structure and inserts it in the correct sorted order in another data structure.
Which Sorting Algorithm has the best time complexity?	All the above sorting algorithms have the same time complexity of O(n^2).

[CheezItMan]

Not bad, your reverse_sentence has O(n²) time complexity, and this could be revised, but it does work and it's in place!

Take a look at my comments and let me know if you have any questions.

[CheezItMan]

Just a note, that insert is an O(n) operation. Could you do this reverse_sentence in O(n) time complexity?

[CheezItMan]

Since you're not making a new array, this is actually O(1).

[CheezItMan]

Nice bubblesort with accurate complexity