java归并排序可视化

这篇博客介绍了如何使用Java实现归并排序,并提供了自顶向下和自底向上的两种方法的详细步骤。通过AlgoFrame、AlgoVisHelper、AlgoVisualizer和MergeSortData等类,实现了排序过程的可视化,帮助读者更好地理解和学习归并排序。文章附带了两种方法的动画效果图。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

1.自顶向下
AlgoFrame.java

package Test;

import java.awt.*;
import javax.swing.*;

public class AlgoFrame extends JFrame {
   
   

    private int canvasWidth;
    private int canvasHeight;

    public AlgoFrame(String title, int canvasWidth, int canvasHeight) {
   
   

        super(title);

        this.canvasWidth = canvasWidth;
        this.canvasHeight = canvasHeight;

        AlgoCanvas canvas = new AlgoCanvas();
        setContentPane(canvas);
        pack();

        setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);
        setResizable(false);

        setVisible(true);
    }

    public AlgoFrame(String title) {
   
   

        this(title, 1024, 768);
    }

    public int getCanvasWidth() {
   
   
        return canvasWidth;
    }

    public int getCanvasHeight() {
   
   
        return canvasHeight;
    }

    // data
    private MergeSortData data;

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

    private class AlgoCanvas extends JPanel {
   
   

        public AlgoCanvas() {
   
   
            // 双缓存
            super(true);
        }

        @Override
        public void paintComponent(Graphics g) {
   
   
            super.paintComponent(g);

            Graphics2D g2d = (Graphics2D) g;

            // 抗锯齿
            RenderingHints hints = new RenderingHints(
                    RenderingHints.KEY_ANTIALIASING,
                    RenderingHints.VALUE_ANTIALIAS_ON);
            hints.put(RenderingHints.KEY_RENDERING, RenderingHints.VALUE_RENDER_QUALITY);
            g2d.addRenderingHints(hints);

            // 具体绘制
            int w = canvasWidth / data.N();
            for (int i = 0; i < data.N(); i++) {
   
   
                if (i >= data.l && i <= data.r)
                    AlgoVisHelper.setColor(g2d, AlgoVisHelper.Green);
                else
                    AlgoVisHelper.setColor(g2d, AlgoVisHelper.Grey);

                if (i >= data.l && i <= data.mergeIndex)
                    AlgoVisHelper.setColor(g2d, AlgoVisHelper.Red);

                AlgoVisHelper.fillRectangle(g2d, i * w, canvasHeight - data.get(i), w - 1, data.get(i));
            }
        }

        @Override
        public Dimension getPreferredSize() {
   
   
            return new Dimension(canvasWidth, canvasHeight);
        }
    }
}

AlgoVisHelper.java

package Test;

import javax.swing.*;
import java.awt.*;
import java.awt.geom.*;

import java.lang.InterruptedException;

public class AlgoVisHelper {
   
   

    private AlgoVisHelper(){
   
   }

    public static final Color Red = new Color(0xF44336);
    public static final Color Pink = new<
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值