Stooge sort: Sorting by Exchanging

最新推荐文章于 2023-08-31 00:55:29 发布

原创最新推荐文章于 2023-08-31 00:55:29 发布 · 805 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#stooge #sort #java #exchange

排序算法专栏收录该内容

29 篇文章

订阅专栏

本文介绍了StoogeSort算法的基本原理及其Java实现。StoogeSort是一种递归排序算法，其最坏情况的时间复杂度为O(nlog3/log1.5)，空间复杂度为O(n)。文章通过一个具体的Java程序示例展示了如何使用StoogeSort对数组进行排序。

Stooge sort

Animation

Visualization of Stooge sort.

Complexity

Class	Sorting algorithm
Data structure	Array
Worst case performance	$O(n^{\log3 / \log1.5})$
Worst case space complexity	$O(n)$

Java program

/**
 * User: >_<
 * Date: 11/12/15
 * Time: 11:19 AM
 */

public class StoogeSort {

    public static void stooge_sort(int[] input, int i, int j){

        if(input[j] < input[i]){
            int temp = input[i];
            input[i] = input[j];
            input[j] = temp;
        }
        if((j-i+1) > 2){
            int t = (j-i+1) / 3;
            stooge_sort(input, i, j-t);
            stooge_sort(input, i+t, j);
            stooge_sort(input, i, j-t);
        }
    }

    public static void main(String[] args) {

        //Prepare the data
        int[] number = {503,87,512,61,908,170,897,275,653,426,154,509,612,677,765,703};

        //Output unsorted Keys
        System.out.println("Unsorted Ks:");
        for(int i=1; i<=number.length; i++){
            System.out.println(i+":"+number[i-1]);
        }
        System.out.println();

        //Kernel of the Algorithm!
        stooge_sort(number, 0, number.length-1);

        //Output sorted Keys
        System.out.println("Sorted Ks:");
        for(int i=1; i<=number.length; i++){
            System.out.println(i+":"+number[i-1]);
        }

    }
}

Outputs

Unsorted Ks:
1:503
2:87
3:512
4:61
5:908
6:170
7:897
8:275
9:653
10:426
11:154
12:509
13:612
14:677
15:765
16:703

Sorted Ks:
1:61
2:87
3:154
4:170
5:275
6:426
7:503
8:509
9:512
10:612
11:653
12:677
13:703
14:765
15:897
16:908