Python實現排序演算法

來源:互聯網
上載者:User

標籤:pre   bsp   change   als   pass   div   python   gpo   short   

一.冒泡排序

 

def bubbleSort(alist):for passnum in range(len(alist) - 1,0,-1):for i in range(passnum):if alist[i] > alist[i+1]:temp = alist[i]alist[i] = alist[i+1]alist[i+1] = tempalist = [1,3,5,2,4,6,8,7]bubbleSort(alist)print(alist)

 

 

短冒泡排序(效率更高):

def shortBubbleSort(alist):exchanges = Truepassnum = len(alist) - 1while passnum > 0 and exchanges:exchanges = Falseprint(‘ww‘)for i in range(passnum):if alist[i] > alist[i+1]:print(alist[i])print(‘xx‘)exchanges = Truetemp = alist[i]alist[i] = alist[i+1]alist[i+1] = temppassnum = passnum - 1 alist = [9,2,4,3,5,1,8,7]shortBubbleSort(alist)print(alist)

  

二.

 

Python實現排序演算法

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

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.