Go language Implementation sorting algorithm

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

One: Insert sort

1: Algorithm Description

1. Starting with the first element, the element can be thought to have been sorted

2. Takes the next element and scans the sequence of elements that have been sorted from back to forward

3. If the element (sorted) is greater than the new element, move the element to the next position

4. Repeat step 3 until you find the sorted element is less than or equal to the position of the new element

5. After inserting a new element into the position

6. Repeat step 2~5

2: Code implementation

Func Insertsort (p []int) {

For i: = 1; i < Len (p); i++ {

For j: = I-1; J >= 0 && p[j+1] < p[j]; j--{

P[J+1], p[j] = P[j], p[j+1]

}

}

}

Two: Bubble sort

1: Algorithm Description

1. Compares the adjacent elements. If the first one is bigger than the second one, swap them both.

2. Do the same for each pair of adjacent elements, starting with the last pair from the first pair to the end. When this is done, the final element will be the maximum number.

3. Repeat the above steps for all elements, except for the last one.

4. Repeat the above steps each time for fewer elements, until there are no pairs of numbers to compare.

2: Program Implementation

Func Bubblesort (p []int) {

For i: = 1; i < Len (p)-1; i++ {

For j: = 0; J < Len (p)-I.; J + + {

If P[J] > p[j+1] {

P[J+1], p[j] = P[j], p[j+1]

}

}

}

}