Insertion Sort - 插入排序

     插入排序算法的 '时间复杂度' 是输入规模的二次函数, 深度抽象后表示为, n 的二次方.

 import time, random

 F = 0

 alist = []

 while F < 13:

     F += 1

     alist.append(random.randrange(0,100))

 j =1

 print("List-O",alist)

 startT =time.time()

 while j < alist.__len__():

     factor = alist[j]

     j += 1

     print("-",factor)

     i = j -1

     while i > 0:

         i -= 1

         if alist[i] > factor:

             alist[i],alist[i+1] = alist[i+1],alist[i]

         print("Steps", alist)

 endT = time.time()

 print("List-S", alist)

 print("Time elapsed :", endT - startT)

 Output,

 List-O [67, 22, 94, 33, 81, 92, 65, 94, 56, 10, 55, 5, 64]

 - 22

 Steps [22, 67, 94, 33, 81, 92, 65, 94, 56, 10, 55, 5, 64]

 - 94

 Steps [22, 67, 94, 33, 81, 92, 65, 94, 56, 10, 55, 5, 64]

 Steps [22, 67, 94, 33, 81, 92, 65, 94, 56, 10, 55, 5, 64]

 - 33

 Steps [22, 67, 33, 94, 81, 92, 65, 94, 56, 10, 55, 5, 64]

 Steps [22, 33, 67, 94, 81, 92, 65, 94, 56, 10, 55, 5, 64]

 Steps [22, 33, 67, 94, 81, 92, 65, 94, 56, 10, 55, 5, 64]

 - 81

 Steps [22, 33, 67, 81, 94, 92, 65, 94, 56, 10, 55, 5, 64]

 Steps [22, 33, 67, 81, 94, 92, 65, 94, 56, 10, 55, 5, 64]

 Steps [22, 33, 67, 81, 94, 92, 65, 94, 56, 10, 55, 5, 64]

 Steps [22, 33, 67, 81, 94, 92, 65, 94, 56, 10, 55, 5, 64]

 - 92

 Steps [22, 33, 67, 81, 92, 94, 65, 94, 56, 10, 55, 5, 64]

 Steps [22, 33, 67, 81, 92, 94, 65, 94, 56, 10, 55, 5, 64]

 Steps [22, 33, 67, 81, 92, 94, 65, 94, 56, 10, 55, 5, 64]

 Steps [22, 33, 67, 81, 92, 94, 65, 94, 56, 10, 55, 5, 64]

 Steps [22, 33, 67, 81, 92, 94, 65, 94, 56, 10, 55, 5, 64]

 - 65

 Steps [22, 33, 67, 81, 92, 65, 94, 94, 56, 10, 55, 5, 64]

 Steps [22, 33, 67, 81, 65, 92, 94, 94, 56, 10, 55, 5, 64]

 Steps [22, 33, 67, 65, 81, 92, 94, 94, 56, 10, 55, 5, 64]

 Steps [22, 33, 65, 67, 81, 92, 94, 94, 56, 10, 55, 5, 64]

 Steps [22, 33, 65, 67, 81, 92, 94, 94, 56, 10, 55, 5, 64]

 Steps [22, 33, 65, 67, 81, 92, 94, 94, 56, 10, 55, 5, 64]

 - 94

 Steps [22, 33, 65, 67, 81, 92, 94, 94, 56, 10, 55, 5, 64]

 Steps [22, 33, 65, 67, 81, 92, 94, 94, 56, 10, 55, 5, 64]

 Steps [22, 33, 65, 67, 81, 92, 94, 94, 56, 10, 55, 5, 64]

 Steps [22, 33, 65, 67, 81, 92, 94, 94, 56, 10, 55, 5, 64]

 Steps [22, 33, 65, 67, 81, 92, 94, 94, 56, 10, 55, 5, 64]

 Steps [22, 33, 65, 67, 81, 92, 94, 94, 56, 10, 55, 5, 64]

 Steps [22, 33, 65, 67, 81, 92, 94, 94, 56, 10, 55, 5, 64]

 - 56

 Steps [22, 33, 65, 67, 81, 92, 94, 56, 94, 10, 55, 5, 64]

 Steps [22, 33, 65, 67, 81, 92, 56, 94, 94, 10, 55, 5, 64]

 Steps [22, 33, 65, 67, 81, 56, 92, 94, 94, 10, 55, 5, 64]

 Steps [22, 33, 65, 67, 56, 81, 92, 94, 94, 10, 55, 5, 64]

 Steps [22, 33, 65, 56, 67, 81, 92, 94, 94, 10, 55, 5, 64]

 Steps [22, 33, 56, 65, 67, 81, 92, 94, 94, 10, 55, 5, 64]

 Steps [22, 33, 56, 65, 67, 81, 92, 94, 94, 10, 55, 5, 64]

 Steps [22, 33, 56, 65, 67, 81, 92, 94, 94, 10, 55, 5, 64]

 - 10

 Steps [22, 33, 56, 65, 67, 81, 92, 94, 10, 94, 55, 5, 64]

 Steps [22, 33, 56, 65, 67, 81, 92, 10, 94, 94, 55, 5, 64]

 Steps [22, 33, 56, 65, 67, 81, 10, 92, 94, 94, 55, 5, 64]

 Steps [22, 33, 56, 65, 67, 10, 81, 92, 94, 94, 55, 5, 64]

 Steps [22, 33, 56, 65, 10, 67, 81, 92, 94, 94, 55, 5, 64]

 Steps [22, 33, 56, 10, 65, 67, 81, 92, 94, 94, 55, 5, 64]

 Steps [22, 33, 10, 56, 65, 67, 81, 92, 94, 94, 55, 5, 64]

 Steps [22, 10, 33, 56, 65, 67, 81, 92, 94, 94, 55, 5, 64]

 Steps [10, 22, 33, 56, 65, 67, 81, 92, 94, 94, 55, 5, 64]

 - 55

 Steps [10, 22, 33, 56, 65, 67, 81, 92, 94, 55, 94, 5, 64]

 Steps [10, 22, 33, 56, 65, 67, 81, 92, 55, 94, 94, 5, 64]

 Steps [10, 22, 33, 56, 65, 67, 81, 55, 92, 94, 94, 5, 64]

 Steps [10, 22, 33, 56, 65, 67, 55, 81, 92, 94, 94, 5, 64]

 Steps [10, 22, 33, 56, 65, 55, 67, 81, 92, 94, 94, 5, 64]

 Steps [10, 22, 33, 56, 55, 65, 67, 81, 92, 94, 94, 5, 64]

 Steps [10, 22, 33, 55, 56, 65, 67, 81, 92, 94, 94, 5, 64]

 Steps [10, 22, 33, 55, 56, 65, 67, 81, 92, 94, 94, 5, 64]

 Steps [10, 22, 33, 55, 56, 65, 67, 81, 92, 94, 94, 5, 64]

 Steps [10, 22, 33, 55, 56, 65, 67, 81, 92, 94, 94, 5, 64]

 - 5

 Steps [10, 22, 33, 55, 56, 65, 67, 81, 92, 94, 5, 94, 64]

 Steps [10, 22, 33, 55, 56, 65, 67, 81, 92, 5, 94, 94, 64]

 Steps [10, 22, 33, 55, 56, 65, 67, 81, 5, 92, 94, 94, 64]

 Steps [10, 22, 33, 55, 56, 65, 67, 5, 81, 92, 94, 94, 64]

 Steps [10, 22, 33, 55, 56, 65, 5, 67, 81, 92, 94, 94, 64]

 Steps [10, 22, 33, 55, 56, 5, 65, 67, 81, 92, 94, 94, 64]

 Steps [10, 22, 33, 55, 5, 56, 65, 67, 81, 92, 94, 94, 64]

 Steps [10, 22, 33, 5, 55, 56, 65, 67, 81, 92, 94, 94, 64]

 Steps [10, 22, 5, 33, 55, 56, 65, 67, 81, 92, 94, 94, 64]

 Steps [10, 5, 22, 33, 55, 56, 65, 67, 81, 92, 94, 94, 64]

 Steps [5, 10, 22, 33, 55, 56, 65, 67, 81, 92, 94, 94, 64]

 - 64

 Steps [5, 10, 22, 33, 55, 56, 65, 67, 81, 92, 94, 64, 94]

 Steps [5, 10, 22, 33, 55, 56, 65, 67, 81, 92, 64, 94, 94]

 Steps [5, 10, 22, 33, 55, 56, 65, 67, 81, 64, 92, 94, 94]

 Steps [5, 10, 22, 33, 55, 56, 65, 67, 64, 81, 92, 94, 94]

 Steps [5, 10, 22, 33, 55, 56, 65, 64, 67, 81, 92, 94, 94]

 Steps [5, 10, 22, 33, 55, 56, 64, 65, 67, 81, 92, 94, 94]

 Steps [5, 10, 22, 33, 55, 56, 64, 65, 67, 81, 92, 94, 94]

 Steps [5, 10, 22, 33, 55, 56, 64, 65, 67, 81, 92, 94, 94]

 Steps [5, 10, 22, 33, 55, 56, 64, 65, 67, 81, 92, 94, 94]

 Steps [5, 10, 22, 33, 55, 56, 64, 65, 67, 81, 92, 94, 94]

 Steps [5, 10, 22, 33, 55, 56, 64, 65, 67, 81, 92, 94, 94]

 Steps [5, 10, 22, 33, 55, 56, 64, 65, 67, 81, 92, 94, 94]

 List-S [5, 10, 22, 33, 55, 56, 64, 65, 67, 81, 92, 94, 94]

 Time elapsed : 0.015672683715820312

Algorithms - Insertion Sort - 插入排序的更多相关文章

  1. [Algorithms] Sorting Algorithms (Insertion Sort, Bubble Sort, Merge Sort and Quicksort)

    Recently I systematicall review some sorting algorithms, including insertion sort, bubble sort, merg ...

  2. Algorithms - Insertion sort

    印象 图1 插入排序过程 思想 插入排序(Insertion Sort)的主要思想是不断地将待排序的元素插入到有序序列中,是有序序列不断地扩大,直至所有元素都被插入到有序序列中. 分析 时间复杂度: ...

  3. [Algorithms] Insertion sort algorithm using TypeScript

    Insertion sort is a very intuitive algorithm as humans use this pattern naturally when sorting cards ...

  4. insertion sort(插入排序)

    #include<stdio.h> #include<time.h> int insertion_sort() { ; int a[max],i,j; srand((unsig ...

  5. 经典排序算法 – 插入排序Insertion sort

    经典排序算法 – 插入排序Insertion sort  插入排序就是每一步都将一个待排数据按其大小插入到已经排序的数据中的适当位置,直到全部插入完毕. 插入排序方法分直接插入排序和折半插入排序两种, ...

  6. 【排序基础】5、插入排序法 - Insertion Sort

    插入排序法 - Insertion Sort 文章目录 插入排序法 - Insertion Sort 插入排序设计思想 插入排序代码实现 操作:插入排序与选择排序的比较 简单记录-bobo老师的玩转算 ...

  7. leetcode 147. Insertion Sort List ----- java

    Sort a linked list using insertion sort. 插入排序. /** * Definition for singly-linked list. * public cla ...

  8. [LeetCode] Insertion Sort List 链表插入排序

    Sort a linked list using insertion sort. 链表的插入排序实现原理很简单,就是一个元素一个元素的从原链表中取出来,然后按顺序插入到新链表中,时间复杂度为O(n2) ...

  9. [算法] 插入排序 Insertion Sort

    插入排序(Insertion Sort)是一种简单直观的排序算法.它的工作原理是通过构建有序序列,对于未排序数据,在已排序序列中从后向前扫描,找到相应位置并插入.插入排序在实现上,通常采用in-pla ...

随机推荐

  1. 基于 HTML5 + WebGL 的3D无人机 展示

    前言 近年来,无人机的发展越发迅速,既可民用于航拍,又可军用于侦察,涉及行业广泛,也被称为“会飞的照相机”.但作为军事使用,无人机的各项性能要求更加严格.重要.本系统则是通过 Hightopo 的   ...

  2. Scala实践14

    1.Scala的future 创建future import scala.concurrent._ import ExecutionContext.Implicits.global object Fu ...

  3. 《C# 爬虫 破境之道》：概述

    第一节:写作本书的目的 关于笔者 张晓亭(Mike Cheers),1982年出生,内蒙古辽阔的大草原是我的故乡. 没有高学历,没有侃侃而谈的高谈阔论,拥有的就是那一份对技术的执著,对自我价值的追求. ...

  4. 每天玩转3分钟 MyBatis-Plus - 1. 配置环境

    每天玩转3分钟 MyBatis-Plus - 1. 配置环境 每天玩转3分钟 MyBatis-Plus - 2. 普通查询 MyBatis-Plus(简称 MP)是一个 MyBatis 的增强工具,在 ...

  5. 关于neo4j初入门（4）

    关于admin管理员 数据库备份和恢复 Neo4j数据库备份 步骤1 -点击“Neo4j Community”,如下图所示 Windows“开始”按钮>> "All Progra ...

  6. 关于爬虫的日常复习（7）—— DOM操作及selenium库

  7. Django项目运行

    1.图像界面 2.配置ip和端口 2.命令行 python manage.py runserver ip:端口号 ip:端口号可以不写,为默认 也可以只修改端口号

  8. 机器学习-决策树 Decision Tree

    咱们正式进入了机器学习的模型的部分,虽然现在最火的的机器学习方面的库是Tensorflow, 但是这里还是先简单介绍一下另一个数据处理方面很火的库叫做sklearn.其实咱们在前面已经介绍了一点点sk ...

  9. Uva1014:Remember the Word

    Neal is very curious about combinatorial problems, and now here comes a problem about words. Knowing ...

  10. 初学者学Java常遇到的问题，我都给你回答了！

    前言 只有光头才能变强. 文本已收录至我的GitHub精选文章,欢迎Star:https://github.com/ZhongFuCheng3y/3y 春节在家刷知乎,看到了一个知乎的问题:<学 ...