• Python算法之---冒泡,选择,插入排序算法


    '''

    Created on 2013-8-23
      
    @author: codegeek
    '''
      
    def bubble_sort(seq):
        for i in range(len(seq)):
            for j in range(i,len(seq)):
                if seq[j] < seq[i]:
                    tmp = seq[j]
                    seq[j] = seq[i]
                    seq[i] = tmp
                      
    def selection_sort(seq):
        for i in range(len(seq)):
            position = i
            for j in range(i,len(seq)):
                if seq[position] > seq[j]:
                    position = j
            if position != i:
                    tmp = seq[position]
                    seq[position] = seq[i]
                    seq[i] = tmp
      
    def insertion_sort(seq):
        if len(seq) > 1:
            for i in range(1,len(seq)):
                while i > 0 and seq[i] < seq[i-1]:
                    tmp = seq[i]
                    seq[i] = seq[i-1]
                    seq[i-1] = tmp
                    i = i - 1
                      
    if __name__ == "__main__":
        print "--------bubble_sort-------------"
        seq = [22,1,33,4,7,6,8,9,11]
        bubble_sort(seq)
        print seq
        print "--------selection_sort-------------"
        seq = [88,44,33,4,7,6,8,9,11]
        selection_sort(seq)
        print seq
        print "--------insertion_sort-------------"
        seq = [777,44,33,4,7,6,1111,100,11]
        insertion_sort(seq)
        print seq
  • 相关阅读:
    Java 数组算法列题解析
    Java数组总结
    go实现汉诺塔
    go实现归并排序
    css清除浮动深度解析
    jquery阻止事件冒泡
    java
    getComputedStyle/currentStyle/style之间的爱恨情仇
    js基础总结
    元素堆叠问题、z-index、position
  • 原文地址:https://www.cnblogs.com/chenjingyi/p/5741471.html
Copyright © 2020-2023  润新知