


Detailed explanation of insertion sort in PHP sorting algorithm series
This article mainly introduces the relevant information of insertion sort in the PHP sorting algorithm series to everyone in detail. It has a certain reference value. Interested friends can refer to
insert sort
There is an already ordered data sequence. It is required to insert a number into this already arranged data sequence, but it is required that the data sequence is still ordered after the insertion. In this case, a number must be used. New sorting method - insertion sorting method. The basic operation of insertion sorting is to insert a data into the already sorted ordered data, thereby obtaining a new ordered data with the number plus one. The algorithm is suitable for a small amount of data. The time complexity of data sorting is O(n^2). It is a stable sorting method. The insertion algorithm divides the array to be sorted into two parts: the first part contains all the elements of the array, except for the last element (making the array one more space to have an insertion position), and the second part only contains this one element (i.e. the element to be inserted). After the first part is sorted, this last element is inserted into the sorted first part.
Principle
The basic idea of direct insertion sort (Insertion Sort) is: each time a record to be sorted is inserted into the previously sorted record according to its key size. The appropriate position in the ordered subsequence until all records are inserted.
Suppose the array is a[0...n-1].
1. Initially, a[0] forms an ordered area, and the unordered area is a[1..n-1]. Let i=1
2. Merge a[i] into the current ordered area a[0...i-1] to form an ordered interval of a[0...i].
3.i and repeat the second step until i==n-1. Sorting completed.
PHP code implementation
function insertSort($arr){ //获取需要排序的长度 $length=count($arr); //假定第一个为有序的,所以从$i开始比较 for ($i=1; $i <$length ; $i++) { //存放待比较的值 $tmp=$arr[$i]; for($j=$i-1;$j>=0;$j--){ //若插入值比较小,则将后面的元素后移一位,并将值插入 if($tmp<$arr[$j]){ $arr[$j+1]=$arr[$j]; $arr[$j]=$tmp; }else{ break; } } } return $arr; }
Algorithm time complexity calculation
In the best case (the elements have been arranged order): Then you only need to loop n-1 times, the time complexity is O(n)
In the worst case (the elements are in reverse order): the number of loop adjustments: [ n * (n-1 ) ] / 2, the time complexity is O (n ^ 2)
The average time complexity is: O (n ^ 2)
The above is the entire content of this article, I hope it will be helpful to everyone's learning Help, and I hope everyone will support php Chinese website.
Articles you may be interested in:
Explanation of Bucket Sorting Algorithm in PHP
PHP implements sorting heap sort algorithm
The above is the detailed content of Detailed explanation of insertion sort in PHP sorting algorithm series. For more information, please follow other related articles on the PHP Chinese website!

Hot AI Tools

Undresser.AI Undress
AI-powered app for creating realistic nude photos

AI Clothes Remover
Online AI tool for removing clothes from photos.

Undress AI Tool
Undress images for free

Clothoff.io
AI clothes remover

Video Face Swap
Swap faces in any video effortlessly with our completely free AI face swap tool!

Hot Article

Hot Tools

Notepad++7.3.1
Easy-to-use and free code editor

SublimeText3 Chinese version
Chinese version, very easy to use

Zend Studio 13.0.1
Powerful PHP integrated development environment

Dreamweaver CS6
Visual web development tools

SublimeText3 Mac version
God-level code editing software (SublimeText3)

Hot Topics

PHP 8.4 brings several new features, security improvements, and performance improvements with healthy amounts of feature deprecations and removals. This guide explains how to install PHP 8.4 or upgrade to PHP 8.4 on Ubuntu, Debian, or their derivati

If you are an experienced PHP developer, you might have the feeling that you’ve been there and done that already.You have developed a significant number of applications, debugged millions of lines of code, and tweaked a bunch of scripts to achieve op

Visual Studio Code, also known as VS Code, is a free source code editor — or integrated development environment (IDE) — available for all major operating systems. With a large collection of extensions for many programming languages, VS Code can be c

JWT is an open standard based on JSON, used to securely transmit information between parties, mainly for identity authentication and information exchange. 1. JWT consists of three parts: Header, Payload and Signature. 2. The working principle of JWT includes three steps: generating JWT, verifying JWT and parsing Payload. 3. When using JWT for authentication in PHP, JWT can be generated and verified, and user role and permission information can be included in advanced usage. 4. Common errors include signature verification failure, token expiration, and payload oversized. Debugging skills include using debugging tools and logging. 5. Performance optimization and best practices include using appropriate signature algorithms, setting validity periods reasonably,

A string is a sequence of characters, including letters, numbers, and symbols. This tutorial will learn how to calculate the number of vowels in a given string in PHP using different methods. The vowels in English are a, e, i, o, u, and they can be uppercase or lowercase. What is a vowel? Vowels are alphabetic characters that represent a specific pronunciation. There are five vowels in English, including uppercase and lowercase: a, e, i, o, u Example 1 Input: String = "Tutorialspoint" Output: 6 explain The vowels in the string "Tutorialspoint" are u, o, i, a, o, i. There are 6 yuan in total

This tutorial demonstrates how to efficiently process XML documents using PHP. XML (eXtensible Markup Language) is a versatile text-based markup language designed for both human readability and machine parsing. It's commonly used for data storage an

Static binding (static::) implements late static binding (LSB) in PHP, allowing calling classes to be referenced in static contexts rather than defining classes. 1) The parsing process is performed at runtime, 2) Look up the call class in the inheritance relationship, 3) It may bring performance overhead.

What are the magic methods of PHP? PHP's magic methods include: 1.\_\_construct, used to initialize objects; 2.\_\_destruct, used to clean up resources; 3.\_\_call, handle non-existent method calls; 4.\_\_get, implement dynamic attribute access; 5.\_\_set, implement dynamic attribute settings. These methods are automatically called in certain situations, improving code flexibility and efficiency.
