Python學習筆記19(演算法)

來源:互聯網
上載者:User

標籤:merge   ec2   tmp   end   logs   display   ges   python   code   

1.二分尋找

只能用二分尋找尋找有序列表

def bin_search(data,val):  #data為被尋找的列表,val是要尋找的值    low = 0    high = len(data) - 1    while low <= high:        mid = (low+high)//2        if data[mid] == val:            return mid           #找到了,返回val所在的索引        elif data[mid] < val:            low = mid + 1        else:            high = mid - 1    return                        #未找到,返回None
二分尋找2.冒泡排序
def bubble_sort(data):                   #data傳需要排序的列表    for i in range(len(data)-1):        FLAG = 0        for j in range(len(data)-i-1):            if data[j] > data[j+1]:                data[j],data[j+1] = data[j+1],data[j]                FLAG = 1        if FLAG == 0:            break
冒泡排序3.選擇排序
def select_sort(data):    for i in range(len(data)-1):        min = i        for j in range(i+1,len(data)):            if data[j] < data[min]:                min = j        data[i],data[min] = data[min],data[i]
選擇排序4.插入排序
def insert_sort(data):    for i in range(1,len(data)):        tmp = data[i]        j = i - 1        while j >= 0 and data[j] > tmp:            data[j+1] = data[j]            j = j - 1        data[j + 1] = tmp
插入排序5.快速排序
def quick_sort(data,left,right):    if left < right:        mid = partition(data,left,right)        quick_sort(data,left,mid - 1)        quick_sort(data,mid + 1,right)def partition(data,left,right):    tmp = data[left]    while left < right:        while left < right and data[right] >= tmp:            right -= 1        data[left] = data[right]        while left < right and data[left] <= tmp:            left += 1        data[right] = data[left]    data[left] = tmp    return left
快速排序 6.堆排序
def sift(data,low,high):    i = low    j = 2 * i +1    tmp = data[i]    while j <= high:        if j + 1 <= high and data[j] < data[j+1]:            j += 1        if data[j] > tmp:            data[i] = data[j]            i = j            j = 2 * i + 1        else:            break    data[i] = tmpdef heap_sort(data):    n = len(data)    for i in range(n // 2 - 1 ,-1 ,-1):        sift(data,i,n-1)    for i in range(n-1,-1,-1):        data[0],data[i] = data[i],data[0]        sift(data,0,i-1)
堆排序7.歸併排序
def merge(data,low,mid,high):    i = low    j = mid+1    tmp = []    while i <= mid and j <= high:        if data[i] < data[j]:            tmp.append(data[i])            i += 1        else:            tmp.append(data[j])            j += 1    while i <= mid:        tmp.append(data[i])        i += 1    while j <= high:        tmp.append(data[j])        j += 1    data[low:high+1] = tmpdef mergesort(data,low,high):    if low < high:        mid = (low+high)//2        mergesort(data,low,mid)        mergesort(data,mid+1,high)        merge(data,low,mid,high)
歸併排序

 

 

Python學習筆記19(演算法)

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在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.