数据结构源代码.docVIP

实验一源代码 1、判断数组元素是否已按升序排序 /** * @(#)isSortedArray.java * * isSortedArray application * * @author * @version 1.00 2010/3/5 */ public class isSortedArray { public static boolean isSorted(int[] table) { if(table.length0){ int i=0; for( i=0;i=(table.length-2) table[i]table[i+1];i++); if ( i==table.length-1) return true; } else System.out.println(the table has no number!); return false; } /*判断整数数组是否已按升序排序*/ public static boolean isSorted(Comparable[] table) { if (table!=null){ int i=0; for( i=0;i=(table.length-2) table[i].compareTo(table[i+1])0;i++); if (i==(table.length-1)) return true; } else System.out.println(the table has no object!); return false; } /*判断对象数组是否已按升序排序*/ public static void main(String[] args) { int[] keywords1={1,12,13}; String[] keywords2={abstract,boolean,break,acstract}; if(isSorted(keywords1)) System.out.println(ksywords1 in accent way!); else System.out.println(ksywords1 not in accent way!); if(isSorted(keywords2)) System.out.println(ksywords2 in accent way!); else System.out.println(ksywords2 not in accent way!); } } 2、数组逆置 /** * @(#)ReverseArray.java * * ReverseArray application * * @author * @version 1.00 2010/3/8 */ public class ReverseArray { /*将一个已知数组中所有元素的次序颠倒为相反次序*/ /*交换元素的方法*/ public static void swap(Object[] table, int i,int j) { if(table!=null i=0 itable.length j=0jtable.length i!=j) { Object temp=table[j]; table[j]=table[i]; table[i]=temp; } } /*主方法*/ public static void main(String[] args) { Object[] table={52,26,97,19,66,8,49,18,19}; System.out.println(before Reverse); for(int i=0; itable.length;i++) System.out.print(table[i]+ - ); System.out.println(); for(int i=0;itable.length/2;i++)