Python data structures and Algorithms Nineth Day "select Sort"

Source: Internet
Author: User

1. Select the principle of sorting

2. Code implementation

defSelection_sort (alist): N=Len (alist)#requires a n-1 selection operation     forIinchRange (n-1):        #Record minimum positionMin_index =I#Select the minimum data from the i+1 position to the end         forJinchRange (i+1, N):ifALIST[J] <Alist[min_index]: Min_index=J#If the selected data is not in the correct location, swap        ifMin_index! =I:alist[i], Alist[min_index]=Alist[min_index], alist[i]alist= [54,226,93,17,77,31,44,55,20]selection_sort (alist)Print(alist)

3. Complexity of Time

Optimal time complexity: O (n2)

Worst time complexity: O (n2)

Stability: Unstable (consider ascending each time to select the maximum case)

Python data structures and Algorithms Nineth Day "select Sort"

Related Article

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: 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.