archive

Mon, 01 Jan 0001 00:00:00 +0000

bubble #

visualization #

implement #

import java.util.Arrays;

public class BubbleSort{
 public static void sort(int[] raw){
 for (int i = 1; i < raw.length ; i++) {
 for (int j = 0; j < raw.length - i ; j++) {
 if(raw[j] > raw[j+1])
 switchNumberByTemp(raw,j,j+1);
 }
 }
 }

 public static void switchNumberByTemp(int[] raw,int x, int y){
 int temp = raw[x];
 raw[x] = raw[y];
 raw[y] = temp;
 }

 public static void main(String[] args){
 int[] arr = { 3, 44, 38, 5, 47, 15, 36, 26, 27, 2, 46, 4, 19, 50, 48 };
 sort(arr);
 System.out.println(Arrays.toString(arr));
 }
}

Reference #

https://www.runoob.com/w3cnote/bubble-sort.html

Mon, 01 Jan 0001 00:00:00 +0000

insertion #

visualization #

implement #

import java.util.Arrays;

public class InsertionSort{
 public static void sort(int[] raw){
 for (int i = 1; i < raw.length; i++) {
 int preIndex = i - 1;
 int currentValue = raw[i];
 while(preIndex >= 0 && currentValue < raw[preIndex]){
 // 覆盖循环
 raw[preIndex + 1] = raw[preIndex];
 preIndex--;
 }
 raw[preIndex + 1] = currentValue;
 }
 }

 public static void main(String[] args){
 int[] arr = { 3, 44, 38, 5, 47, 15, 36, 26, 27, 2, 46, 4, 19, 50, 48 };
 sort(arr);
 System.out.println(Arrays.toString(arr));
 }
}

def insertionSort(arr):
    for i in range(len(arr)):
        preIndex = i-1
        current = arr[i]
        while preIndex >= 0 and arr[preIndex] > current:
            arr[preIndex+1] = arr[preIndex]
            preIndex-=1
        arr[preIndex+1] = current
    return arr

Reference #

https://www.runoob.com/w3cnote/selection-sort.html

Mon, 01 Jan 0001 00:00:00 +0000

selection #

visualization #

implement #

import java.util.Arrays;

public class SelectionSort{
 public static void sort(int[] raw){
 for (int i = 0; i < raw.length - 1 ; i++) {
 int temp = i;
 for (int j = i + 1; j < raw.length ; j++) {
 if(raw[temp] > raw[j])
 temp = j;
 }
 switchNumberByXor(raw,i,temp);
 }
 }

 public static void switchNumberByXor(int[] raw, int x, int y ){
 if(raw[x] == raw[y]) return;
 raw[x] = raw[x] ^ raw[y];
 raw[y] = raw[x] ^ raw[y];
 raw[x] = raw[x] ^ raw[y];
 }

 public static void main(String[] args){
 int[] arr = { 3, 44, 38, 5, 47, 15, 36, 26, 27, 2, 46, 4, 19, 50, 48 };
 sort(arr);
 System.out.println(Arrays.toString(arr));
 }
}

Reference #

https://www.runoob.com/w3cnote/selection-sort.html