python插入排序演算法執行個體分析

來源:互聯網
上載者:User
本文執行個體講述了python插入排序演算法。分享給大家供大家參考。具體如下:

def insertsort(array):   for removed_index in range(1, len(array)):     removed_value = array[removed_index]     insert_index = removed_index     while insert_index > 0 and array[insert_index - 1] > removed_value:       array[insert_index] = array[insert_index - 1]       insert_index -= 1     array[insert_index] = removed_value

另外一個版本:

def insertsort(array):   for lastsortedelement in range(len(array)-1):     checked = lastsortedelement     while array[checked] > array[lastsortedelement + 1] and checked >= 0:       checked -= 1     #Insert the number into the correct position     array[checked+1], array[checked+2 : lastsortedelement+2] = array[lastsortedelement+1], array[checked+1 : lastsortedelement+1]   return array

希望本文所述對大家的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.