Algorithms - Insertion Sort

 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 - 插入排序的更多相关文章

[Algorithms] Sorting Algorithms (Insertion Sort, Bubble Sort, Merge Sort and Quicksort)
Recently I systematicall review some sorting algorithms, including insertion sort, bubble sort, merg ...
Algorithms - Insertion sort
印象图1 插入排序过程思想插入排序(Insertion Sort)的主要思想是不断地将待排序的元素插入到有序序列中,是有序序列不断地扩大,直至所有元素都被插入到有序序列中. 分析时间复杂度: ...
[Algorithms] Insertion sort algorithm using TypeScript
Insertion sort is a very intuitive algorithm as humans use this pattern naturally when sorting cards ...
insertion sort(插入排序)
#include<stdio.h> #include<time.h> int insertion_sort() { ; int a[max],i,j; srand((unsig ...
经典排序算法 – 插入排序Insertion sort
经典排序算法 – 插入排序Insertion sort 插入排序就是每一步都将一个待排数据按其大小插入到已经排序的数据中的适当位置,直到全部插入完毕. 插入排序方法分直接插入排序和折半插入排序两种, ...
【排序基础】5、插入排序法 - Insertion Sort
插入排序法 - Insertion Sort 文章目录插入排序法 - Insertion Sort 插入排序设计思想插入排序代码实现操作:插入排序与选择排序的比较简单记录-bobo老师的玩转算 ...
leetcode 147. Insertion Sort List ----- java
Sort a linked list using insertion sort. 插入排序. /** * Definition for singly-linked list. * public cla ...
[LeetCode] Insertion Sort List 链表插入排序
Sort a linked list using insertion sort. 链表的插入排序实现原理很简单,就是一个元素一个元素的从原链表中取出来,然后按顺序插入到新链表中,时间复杂度为O(n2) ...
[算法] 插入排序 Insertion Sort
插入排序(Insertion Sort)是一种简单直观的排序算法.它的工作原理是通过构建有序序列,对于未排序数据,在已排序序列中从后向前扫描,找到相应位置并插入.插入排序在实现上,通常采用in-pla ...

随机推荐

微信小程序之猜拳游戏
---恢复内容开始--- 最近几天在学习小程序,看了网上的学习视频,于是自己捣鼓着做出了视频里面的小程序. 这是实现的效果图一个小程序页面,一般有三个部分文件组成,index.js 这个文件里面放的 ...
Ceph日常运维管理和排错 -- <7>
Ceph日常运维管理集群监控管理集群整体运行状态 [root@cephnode01 ~]# ceph -s cluster: id: 8230a918-a0de-4784-9ab8-cd2a2b8 ...
我是如何做到springboot自动配置原理解析
一前言 springboot 2.0.0版本分析,整体的自动配置流程如下: 具体配置参考官方文档:springboot-doc 二 @SpringBootApplication 核心注解@Spring ...
初识runtime
首先需要加上头文件#import<objc/runtime.h>和#Import<objc/message.h> 将A中的某个方法替换成B中某个方法,且没有任何的耦合这里 ...
简述http协议及抓包分析
1:HTTP请求头和响应头的格式 1:HTTP请求格式:<request-line><headers><blank line>[<request-body&g ...
eclipse开发工具内打开某js文件总是用记事本方式打开的问题
问题现象: 开发时不知道按到了什么快捷键,导致在某js文件内点击某调用方法时莫名其妙的用记事本方式打开了该js文件,试了几次都是这样.索性将该js文件关掉重新打开,结果双击该文件还是弹出了一个记事本, ...
Flask蓝图(Blueprint)
一.作用 1.目录结构划分 2.url添加前缀 url_prefix 3.应用特殊装饰器,在该蓝图定义的特殊装饰器,只在改蓝图的起效二.简单示例 1.创建一个项目文件 2.创建一个同名的python ...
为什么你应该使用 Kubernetes(k8s)
Kubernetes (Kube 或 K8s)越来越流行,他是市场上最好的容器编排工具之一. 1. 什么是容器? 容器就是一个包,其中包含了应用及其所有依赖. 容器中的应用与主机系统是隔离的,不关注环 ...
[洛谷P4707] 重返现世
Description 为了打开返回现世的大门,\(Yopilla\) 需要制作开启大门的钥匙.\(Yopilla\) 所在的迷失大陆有 \(n\) 种原料,只需要集齐任意 \(k\) 种,就可以开始 ...
Sublime Text 3 部分安装过程记录
概览: Sublime Text 3下载网址 Package Control的安装 Install Package报错(There are no packages availabel for inst ...

Algorithms - Insertion Sort - 插入排序

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

随机推荐

热门专题