Since I wrote 6 sorting algorithms last week, I would write some more details about selection sort, quick sort, merge sort. For these three different sorting algorithms, they have different run times at different inputs.
When they have randomized input, merge sort and quick sort have the most efficiency which are O(nlogn). Selection sort worse than the other two, which is O(n^2). When they have Reverse-sort input, selection sort and merge sort do not change at all. Selection sort is O(n^2). Merge sort is O(nlogn). However, Quick sort changes a lot, becomes to the worst efficiency, which is O(n^2), When they have sorted input, Selection sort still is the worst, which is O(n^2). Quick sort is O(nlogn) and merge sort is O(n). Merge sort have the most efficiency.
In conclusion, Select sort is the most stable soring algorithms at any situations. For the other sorts, we need to use them at specific input.
This is our last SLOG, thank you for reading my blogger!
Good luck for our final exam! Fighting!!!
No comments:
Post a Comment