1幅漫画带你认识这3种奇奇怪怪的排序算法
2020-07-25 本文已影响0人
5893d0835188
在算法的世界里,有许多高效率的排序算法,比如快速排序、归并排序、桶排序......它们大大提高了程序的性能。
但是,也有一些比较奇葩的排序算法,它们既不能做到高效率,也没有很好的可读性。那它们存在的意义是什么呢?因为有趣呀。
下面,让我们来介绍三种“异想天开”的排序算法。
1.睡眠排序


————— 第二天 —————




public static void sleepSort(int[] array){ for (int num : array) { new Thread(() -> { try { Thread.sleep(num); } catch (InterruptedException e) { e.printStackTrace(); } System.out.println(num); }).start(); }}public static void main(String[] args) { int[] array = {10,30,50,60,100,40,150,200,70}; sleepSort(array);}


}






————————————



(小灰把自己的代码给大黄展示了)






2.猴子排序



或许这样说比较抽象,让我们来演示一下:



3.珠排序



见过算盘的人都知道,算盘上有许多圆圆的珠子被串在细杆上,就像下面这样:

如果把算盘竖起来,会发生什么呢?算盘上的小珠子会在重力的作用下滑到算盘底部,就像下面这样:



什么意思呢?我们来仔细说明一下:

在珠子下落之前,每一横排有几个珠子?如上图所示,每排珠子的数量分别是3, 2, 4, 5, 1,这个数列是无序的。

当珠子下落以后,每一横排有又几个珠子?如上图所示,每排珠子的数量变成了1, 2, 3, 4, 5,这个数列是有序的!
那么,我们可不可以模拟珠子下落的原理,对一组正整数进行排序呢?答案是可以的。
我们可以用二维数组来模拟算盘,有珠子的位置设为1,没有珠子的位置设为0。那么,一个无序的整型数组就可以转化成下面的二维数组:

接下来,我们模拟算盘珠子掉落的过程,让所有的元素1都落到二维数组的最底部:

最后,把掉落后的 “算盘” 转化成一维有序数组:




—————END—————
作者:程序员小灰
原文链接:https://juejin.im/post/5de7292e6fb9a01648714ca4