看的见得算法第四章排序算法可视化_使用vs2019实现排序可视化-CSDN博客

本文介绍了一个使用Java实现的选择排序算法的动画展示程序。通过自定义的SelectionSortData类生成随机数数组，并在AlgoFrame中绘制这些数据。AlgoVisualizer负责动画逻辑，通过遍历数组，找到未排序部分的最小值并与其交换位置，每一步操作都实时更新界面，展示了选择排序的工作过程。

4-1

SelectionSortData.java

public class SelectionSortData {
    private int[] numbers;//数据
    public SelectionSortData(int N, int randomBound){
        numbers = new int[N];
        for( int i = 0 ; i < N ; i ++)
            numbers[i] = (int)(Math.random()*randomBound) + 1;
    }
    public int N(){
        return numbers.length;
    }
    public int get(int index){
        if( index < 0 || index >= numbers.length)
            throw new IllegalArgumentException("Invalid index to access Sort Data.");
        return numbers[index];
    }
    public void swap(int i, int j) {
        if( i < 0 || i >= numbers.length || j < 0 || j >= numbers.length)
            throw new IllegalArgumentException("Invalid index to access Sort Data.");
        int t = numbers[i];
        numbers[i] = numbers[j];
        numbers[j] = t;
    }
}

AlgoFrame.java

    private SelectionSortData data;
    public void render(SelectionSortData data){
        this.data = data;
        repaint();
    }

 // TODO： 绘制自己的数据data
            int w = canvasWidth/data.N();
            for(int i = 0 ; i < data.N() ; i ++ ) {
                AlgoVisHelper.setColor(g2d, AlgoVisHelper.LightBlue);
                AlgoVisHelper.fillRectangle(g2d, i * w, canvasHeight - data.get(i), w - 1, data.get(i));
            }

AlgoVisualizer.java

 // 动画逻辑
    private void run(){
        // TODO: 编写自己的动画逻辑
        frame.render(data);
        AlgoVisHelper.pause(DELAY);
        for( int i = 0 ; i < data.N() ; i ++ ){
            // 寻找[i, n)区间里的最小值的索引
            int minIndex = i;
            for( int j = i + 1 ; j < data.N() ; j ++ ){
                frame.render(data);
                AlgoVisHelper.pause(DELAY);
                if( data.get(j) < data.get(minIndex) ){
                    minIndex = j;
                    frame.render(data);
                    AlgoVisHelper.pause(DELAY);
                }
            }
            data.swap(i , minIndex);
            frame.render(data);
            AlgoVisHelper.pause(DELAY);
        }
        frame.render(data);
        AlgoVisHelper.pause(DELAY);
    }