Fighting_Man的博客

/** * 单向队列 * @author huyua * */ public class Queue { //队列大小 private int maxSize; //队列数组 private int arr[]; //队头 private int font; //队尾 private int end; //有效长度 private int elem; publ...

利用栈来实现 /* * 字符栈 */ public class CharStzck { private int maxSize; private char[] arr; private int top; public CharStzck(int size) { this.maxSize = size; arr = new char[maxSize]; this....

public class MyStack { private int maxSize; private int[] arr; private int top; //初始化栈 public MyStack(int size) { this.maxSize=size; arr = new int[maxSize]; top=-1; } //压栈 public...

public class InsertSort { /* * 思路：取出一个数据，和它前面的数据进行比较，找到一个插入点 * 将其插入，并将大的数后移 */ public static void insertSort(int arr[]) { int data=0; //取出数据 for(int i =1 ;i<arr.length;i++) { data=arr[i]; ...

public class TestSelect { public static void sortSelect( int [] arr) { int min=0; //趟数 for( int i =0 ; i< arr. length-1; i++) { min= i...

冒泡排序经典的排序算法 public class TestMaoPao { public static void sortBub(int [] arr) { //总的交换次数 int count =0; //遍历数组的趟数 for...