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. Oozie任务调度框架详解及使用简介(一)

    摘要:个人最近一段时间一直在使用oozie,从刚开始的各种别扭到现在越来越觉得有意思的情况下,想整理一下关于oozie的认知,整理出来一个oozie系列,本来市面上关于oozie的资料就比较少,希望写 ...

  2. Spark集群-Standalone 模式

    Spark 集群相关 table td{ width: 15% } 来源于官方, 可以理解为是官方译文, 外加一点自己的理解. 版本是2.4.4 本篇文章涉及到: 集群概述 master, worke ...

  3. web实现点击左侧导航，右侧加载不同的网页（这种布局多用于后台管理系统）

    (1)实现方法:采用ajax实现点击左侧菜单,右侧加载不同网页(在整个页面无刷新的情况下实现右侧局部刷新,用到ajax注意需要在服务器环境下运行,从HBuilder自带的服务器中打开浏览效果即可) ( ...

  4. JMeter——分布式压测

    一.Jmeter4.0分布式压测准备工作 压测注意事项            the firewalls on the systems are turned off or correct ports ...

  5. Ansible Playbooks常用模块

    File模块 在目标主机创建文件或目录,并赋予其系统权限 - name: create a file file:'path=/oot/foo.txt state=touch mode=0755 own ...

  6. （转）宽字节编码类型的XSS

    今晚又看了一遍PKAV-心上的瘦子写的xss腾讯系列的例子,收获挺大的,其中对宽字节注入有了更深的了解,又查找了一些相关的资料,整理一下,以备以后查阅 参考文档: http://book.2cto.c ...

  7. 玩转Django2.0---Django笔记建站基础十一(一)(音乐网站开发)

    第十一章 音乐网站开发 本章以音乐网站项目为例,介绍Django在实际项目开发中的应用,该网站共分为6个功能模块分别是:网站首页.歌曲排行榜.歌曲播放.歌曲点评.歌曲搜索和用户管理. 11.1 网站需 ...

  8. 创建自定义的RouteBase实现(Creating a Custom RouteBase Implementation) |定制路由系统 |

  9. Java Swing图形界面开发

    本文转自xietansheng的CSDN博客内容,这是自己见过的最通俗易懂.最适合快速上手做Java GUI开发的教程了,这里整合一下作为自己以后复习的笔记: 原文地址:https://blog.cs ...

  10. sqli_labs学习笔记（一）Less-1~Less-20

    开门见山 Less-1 GET - Error based - Single quotes - String(基于错误的GET单引号字符型注入) ·  方法一:手工UNION联合查询注入 输入单引号, ...