纵横四海的博客

package mainimport ( "fmt" )func InsertSort(a []int) { if len(a) == 0 { return } length := len(a) for i := 1; i < length; i++ {//默认第一个排序是正确的 j := i target := a[i]

codepackage mainimport ( "fmt" )func swap(i, j int, a []int) { a[i], a[j] = a[j], a[i]}func partition(a []int, left, right int) int { pivotKey := a[left] pivotPointer := left for left

package mainimport ( “fmt” )//交换值函数 func swap(i, j int, a []int) { a[i], a[j] = a[j], a[i] }//冒泡排序实现函数 func BubbleSort(a []int) {if len(a) == 0 { return }length := len(a)for i := 0; i

node-maobao.js‘use strict’class BubbleSort{constructor(a){ this.a = a }swap(i,j,a){ let tmp; tmp=a[i]; a[i] = a[j]; a[j] = tmp;} Sort(){ let self = this; for (var i = 0; i <

package mainimport ( "fmt" )func swap(i, j int, a []int) { a[j], a[i] = a[i], a[j]} func headAdjust(a []int, start, end int) { temp := a[start] for i := 2*start + 1; i <= end; i *= 2 {

实际上bitmap算法是去重算法之一 1.hashset也可以实现去重的功能，但是耗内存比较多 2.相关的开源实现