Java—wang的博客

1.希尔排序：希尔排序交换式：希尔排序移位法：2.快速排序：

1.选择排序：代码实现： public static void selectSort(int[] array){ for (int j = 0;j < array.length-1;j++) { int minIndex = j; int min = array[j]; for (int i = j+1; i < array.length; i++) { if

介绍：冒泡排序： for (int i = 0; i<num.length-1;i++){ for (int j = 0;j<num.length-i-1;j++){ if (num[j]>num[j+1]){ int temp = num[j]; num[j] = num[j+1]; num[j+

1.递归：迷宫问题：八皇后问题：

1.栈的前缀中缀后缀表达式：

1.用栈实现计算器：public class test { public static void main(String[] args) { String e = "70+2*6-4"; Stack num = new Stack(10); Stack operate = new Stack(5); int index = 0; int num1 = 0; int num2 = 0;

1.栈：数组模拟栈：class Stack{ private int maxSize; private int[] stack; private int top = -1; public Stack(int maxSize) { this.maxSize = maxSize; stack = new int[maxSize]; } public boolean isFull(){ return

1.单向循环链表：代码实现：class Boy{ private int no; private Boy next; public Boy(int no) { this.no = no; } public int getNo() { return no; } public void setNo(int no) { this.no = no; } public Boy

1.双向链表：代码实现：class Node{ public int no; public String name; public Node next; public Node pre; public Node(int no, String name) { this.no = no; this.name = name; } @Override public String toString() {

1.链表：介绍：

1.线性结构和非线性结构：2.队列：数组实现队列：class ArrayQueue { private int front; private int rear; private int MaxSize; private int[] array; public ArrayQueue(int maxSize) { MaxSize = maxSize; array = new int[maxSize]; fr