JavaScript, "Insert Sort" of python,go,java,c# Series algorithm

This is a creation in Article, where the information may have evolved or changed.

Insert Sort

Insert Sort (English: insertion sort) is a simple and intuitive sorting algorithm. It works by constructing an ordered sequence, for unsorted data, to scan from backward forward in the sorted sequence, to find the appropriate position and insert it. The insertion sort is implemented on an implementation, usually in the order of In-place (that is, the ordering of extra space using only O (1), so that in the backward-forward scanning process, the ordered elements need to be moved back and forth gradually, providing the insertion space for the newest elements.

Insert sort and bubble sort, there is also an optimization algorithm called split-half insertion.

2. Algorithm steps

• The first element of the first order sequence is treated as an ordered sequence, and the second element to the last element as an unordered sequence.

• Scans the unordered sequence from beginning to end, inserting each element scanned into the appropriate position of the ordered sequence. (If the element you want to insert is equal to an element in an ordered sequence, insert the element you want to insert behind the equal element.) ）

2. Dynamic Diagram Demonstration

3. JavaScript Code Implementation

4. Python Code Implementation

5. Go Code Implementation

6. Java implementation

7 another version of Java

8. C # Implementation

Login to the http://www.learnbo.com/Academy website

Or follow our official Weibo blog, and more!