weixin_51194339的博客

Inserttion sort It is a simple sorting algorithm that work simliar to the way you sort palying cards in your hand. split into sorted and an unsorted pat pick a number N, compare (n~1,and n-1 has sorted.), if n < (n-1), index[n] <n-1. and n-1 compa

Core idea: each find max number,put it in unused postion Introduce loop : A find a number i and i is max number in array. swap i and n. then n=n-1 repeat A until n ==0 Code private static void selectSort(int[] a) { for (int i = 0;...

Bubble sort core idea: a stability sorting algorithm .find a max number and put it in last position by compare. Introduce: Begain A: starting from the first index , compare the first and the second.if the first greater than ...