Comparison of various sorting algorithms and comparison of sorting algorithms

Source: Internet
Author: User

Comparison of various sorting algorithms and comparison of sorting algorithms

1. Time Complexity

Sorting algorithms with a time complexity of O (n ^ 2): Insert sorting, Bubble sorting, and select sorting

Sorting algorithms with time complexity of O (nlogn): heap sorting, Merge Sorting, and quick sorting

The hill sorting is between the two.

2. algorithm Stability

Stable sorting algorithms: insert sorting, Bubble sorting, Merge Sorting, and base sorting

Unstable sorting algorithms: sorting, fast sorting, Hill sorting, and heap sorting

Copyright Disclaimer: This article is an original article by the blogger. For more information, see the source.

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.