插入排序算法

xiaoxiao2021-02-28  22

package com.cn.sort; public class InsertSort { public static void main(String[] args) { int arr[] = {45,89,56,23,10,20}; sort(arr); for (int i = 0; i < arr.length; i++) { System.out.print(arr[i]+" "); } } public static void sort(int arr[]) { int tmp = 0; int j = 0; for (int i = 1; i < arr.length; i++) { j = i; tmp = arr[i]; while (j > 0 && tmp < arr[j-1]) { arr[j] = arr[j-1]; j--; } arr[j] = tmp; } } }

运行后的结果:

转载请注明原文地址: https://www.6miu.com/read-2612879.html

最新回复(0)