Bubble Sort
tl;dr:
sort
Table of contents:
introl
bubblesort is stable sort
implemanet
func BubbleSort(nums []int) {
lens := len(nums)
if lens < 2 {
return
}
for i := 0; i < lens; i ++ {
for j := 0; j < lens -i -1; j ++ {
if nums[j] > nums[j +1] {
nums[j], nums[j+1] = nums[j+1], nums[j]
}
}
}
}