用java实现简单选择排序的动态演示

        最近学了虚拟机的课程，老师给的作业是要求动态演示一种数据结构或者算法。之前还没有这方面的基础，所以选择了一个比较简单的选择排序来作为作业。实现起来并不难，只要把大体的界面搭好，然后把绘制节点，绘制数据，重绘，绘制箭头还有交换节点等函数写好，再写算法的逻辑，运用上刚才所写的函数，然后创建线程来循环实现就可以了。下面是本次作业的源代码。

 

Demo.java

import java.awt.Canvas;
import java.awt.Color;
import java.awt.Component;
import java.awt.Dimension;
import java.awt.Graphics;
import java.awt.Image;

public class Demo extends Canvas
{
  private final int NO_START = -1;
  private final int HAS_START = 0;
  private final int HAS_OVER = 1;

  private final int BX = 20;
  private final int BY = 20;
  private int DX = 30;
  private final int DY = 15;
  private final int WIDTH = 20;
  private final int HEIGHT = 30;
  private int m_nNum;
  private int m_nIIndex;
  private int m_nJIndex;
  private int m_nTemp;
  //private int m_nLast;
  private int m_nCur;
  private String m_sOldData;
  private char[] m_sData = new char[12];

  private int m_nStatus = -1;
  private boolean m_bSortType = true;
  private Graphics m_Graph;
  private Graphics m_offG;
  private Image m_offImg;

  public void paint(Graphics g)//根据状态值m_nStatus来绘图，并且通过m_nIIndex，m_nJIndex和m_nTemp来控制箭头
  {
    this.m_offG.clearRect(0, 0, getSize().width, getSize().height);
    switch (this.m_nStatus)
    {
    case -1:
      break;
    case 0:
      drawData(false, this.m_offG);

      for (int i = 1; i < this.m_nNum + 1; i++)
      {
        if (this.m_nCur == i)
          continue;
        Color color;
        if ((i != this.m_nIIndex) && (i != this.m_nJIndex))
          color = Color.black;
        else
          color = Color.yellow;
        drawNode(this.m_sData[i], i, 10, getBackground(), color, this.m_offG);
      }

      if (this.m_nIIndex <= this.m_nNum){
        drawArrow('i', this.m_nIIndex, 10, Color.red, this.m_offG);
      }
      if ((this.m_nJIndex > this.m_nIIndex) && (this.m_nJIndex <= this.m_nNum)) {
        drawArrow('j', this.m_nJIndex, 10, Color.red, this.m_offG); 
      }
      if ((this.m_nTemp >= 1) && (this.m_nTemp <= this.m_nNum)){
        drawArrow1('t', this.m_nTemp, 10, Color.green, this.m_offG);  
      }
      g.drawImage(this.m_offImg, 0, 0, this);
      break;
    case 1:
      drawData(true, this.m_offG);
      g.drawImage(this.m_offImg, 0, 0, this);
      break;
    }
  }

  public int proceed(int nStep)//这是算法执行的主要逻辑，其中case中的值要与Applet1.java中的showSource的nStep相对应起来
  {                             //这里的逻辑主要是简单的选择排序
    int nextStep = -1;
    //int j = 0;
    switch (nStep)
    {
    case -1:
      this.m_nStatus = 0;
      nextStep = 0;
      break;
    case 0:
      nextStep = 2;
      this.m_nIIndex = 0;
      break;
    case 2:
    	this.m_nIIndex += 1;
        if (this.m_nIIndex > this.m_nNum)
          nextStep = 10;
        else
          nextStep = 3;
        break;
    case 3:
    	this.m_nTemp = this.m_nIIndex;
    	this.m_nJIndex = this.m_nIIndex;
        nextStep = 4;
        break;
    case 4:
      this.m_nJIndex += 1;
      if (this.m_nJIndex <= this.m_nNum)
        nextStep = 5;
      else
        nextStep = 7;
      break;
    case 5:
      //j = this.m_nJIndex;
      for (int i = 0; i < 3; i++)
      {  //显示一下动态效果
        drawNode(this.m_sData[this.m_nTemp], this.m_nTemp, 10, Color.red, Col