import org.rut.util.algorithm.SortUtil;
/**
聽* @author treeroot
聽* @since 2006-2-2
聽* @version 1.0
聽*/
public class InsertSort implements SortUtil.Sort{
聽聽聽 /* (non-Javadoc)
聽聽聽聽 * @see org.rut.util.algorithm.SortUtil.Sort#sort(int[])
聽聽聽聽 */
聽聽聽 public void sort(int[] data) {
聽聽聽聽聽聽聽 int temp;
聽聽聽聽聽聽聽 for(int i=1;i<data.length;i++){
聽聽聽聽聽聽聽聽聽聽聽 for(int j=i;(j>0)&&(data[j]<data[j-1]);j--){
聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽 SortUtil.swap(data,j,j-1);
聽聽聽聽聽聽聽聽聽聽聽 }
聽聽聽聽聽聽聽 }聽聽聽聽聽聽聽
聽聽聽 }
}
鍐掓場鎺掑簭:
package org.rut.util.algorithm.support;
import org.rut.util.algorithm.SortUtil;
/**
聽* @author treeroot
聽* @since 2006-2-2
聽* @version 1.0
聽*/
public class BubbleSort implements SortUtil.Sort{
聽聽聽 /* (non-Javadoc)
聽聽聽聽 * @see org.rut.util.algorithm.SortUtil.Sort#sort(int[])
聽聽聽聽 */
聽聽聽 public void sort(int[] data) {
聽聽聽聽聽聽聽 int temp;
聽聽聽聽聽聽聽 for(int i=0;i<data.length;i++){
聽聽聽聽聽聽聽聽聽聽聽 for(int j=data.length-1;j>i;j--){
聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽 if(data[j]<data[j-1]){
聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽 SortUtil.swap(data,j,j-1);
聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽 }
聽聽聽聽聽聽聽聽聽聽聽 }
聽聽聽聽聽聽聽 }
聽聽聽 }
}
閫夋嫨鎺掑簭:
package org.rut.util.algorithm.support;
import org.rut.util.algorithm.SortUtil;
/**
聽* @author treeroot
聽* @since 2006-2-2
聽* @version 1.0
聽*/
public class SelectionSort implements SortUtil.Sort {
聽聽聽 /*
聽聽聽聽 * (non-Javadoc)
聽聽聽聽 *
聽聽聽聽 * @see org.rut.util.algorithm.SortUtil.Sort#sort(int[])
聽聽聽聽 */
聽聽聽 public void sort(int[] data) {
聽聽聽聽聽聽聽 int temp;
聽聽聽聽聽聽聽 for (int i = 0; i < data.length; i++) {
聽聽聽聽聽聽聽聽聽聽聽 int lowIndex = i;
聽聽聽聽聽聽聽聽聽聽聽 for (int j = data.length - 1; j > i; j--) {
聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽 if (data[j] < data[lowIndex]) {
聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽 lowIndex = j;
聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽 }
聽聽聽聽聽聽聽聽聽聽聽 }
聽聽聽聽聽聽聽聽聽聽聽 SortUtil.swap(data,i,lowIndex);
聽聽聽聽聽聽聽 }
聽聽聽 }
}
Shell鎺掑簭:
package org.rut.util.algorithm.support;
import org.rut.util.algorithm.SortUtil;
/**
聽* @author treeroot
聽* @since 2006-2-2
聽* @version 1.0
聽*/
public class ShellSort implements SortUtil.Sort{
聽聽聽 /* (non-Javadoc)
聽聽聽聽 * @see org.rut.util.algorithm.SortUtil.Sort#sort(int[])
聽聽聽聽 */
聽聽聽 public void sort(int[] data) {
聽聽聽聽聽聽聽 for(int i=data.length/2;i>2;i/=2){
聽聽聽聽聽聽聽聽聽聽聽 for(int j=0;j<i;j++){
聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽 insertSort(data,j,i);
聽聽聽聽聽聽聽聽聽聽聽 }
聽聽聽聽聽聽聽 }
聽聽聽聽聽聽聽 insertSort(data,0,1);
聽聽聽 }
聽聽聽 /**
聽聽聽聽 * @param data
聽聽聽聽 * @param j
聽聽聽聽 * @param i
聽聽聽聽 */
聽聽聽 private void insertSort(int[] data, int start, int inc) {
聽聽聽聽聽聽聽 int temp;
聽聽聽聽聽聽聽 for(int i=start+inc;i<data.length;i+=inc){
聽聽聽聽聽聽聽聽聽聽聽 for(int j=i;(j>=inc)&&(data[j]<data[j-inc]);j-=inc){
聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽 SortUtil.swap(data,j,j-inc);
聽聽聽聽聽聽聽聽聽聽聽 }
聽聽聽聽聽聽聽 }
聽聽聽 }
}
蹇熸帓搴?
package org.rut.util.algorithm.support;
import org.rut.util.algorithm.SortUtil;
/**
聽* @author treeroot
聽* @since 2006-2-2
聽* @version 1.0
聽*/
public class QuickSort implements SortUtil.Sort{
聽聽聽 /* (non-Javadoc)
聽聽聽聽 * @see org.rut.util.algorithm.SortUtil.Sort#sort(int[])
聽聽聽聽 */
聽聽聽 public void sort(int[] data) {
聽聽聽聽聽聽聽 quickSort(data,0,data.length-1);聽聽聽聽聽聽聽
聽聽聽 }
聽聽聽 private void quickSort(int[] data,int i,int j){
聽聽聽聽聽聽聽 int pivotIndex=(i+j)/2;
聽聽聽聽聽聽聽 //swap
聽聽聽聽聽聽聽 SortUtil.swap(data,pivotIndex,j);
聽聽聽聽聽聽聽
聽聽聽聽聽聽聽 int k=partition(data,i-1,j,data[j]);
聽聽聽聽聽聽聽 SortUtil.swap(data,k,j);
聽聽聽聽聽聽聽 if((k-i)>1) quickSort(data,i,k-1);
聽聽聽聽聽聽聽 if((j-k)>1) quickSort(data,k+1,j);
聽聽聽聽聽聽聽
聽聽聽 }
聽聽聽 /**
聽聽聽聽 * @param data
聽聽聽聽 * @param i
聽聽聽聽 * @param j
聽聽聽聽 * @return
聽聽聽聽 */
聽聽聽 private int partition(int[] data, int l, int r,int pivot) {
聽聽聽聽聽聽聽 do{
聽聽聽聽聽聽聽聽聽聽 while(data[++l]<pivot);
聽聽聽聽聽聽聽聽聽聽 while((r!=0)&&data[--r]>pivot);
聽聽聽聽聽聽聽聽聽聽 SortUtil.swap(data,l,r);
聽聽聽聽聽聽聽 }
聽聽聽聽聽聽聽 while(l<r);
聽聽聽聽聽聽聽 SortUtil.swap(data,l,r);聽聽聽聽聽聽聽
聽聽聽聽聽聽聽 return l;
聽聽聽 }
}
鏀硅繘鍚庣殑蹇熸帓搴?
package org.rut.util.algorithm.support;
import org.rut.util.algorithm.SortUtil;
/**
聽* @author treeroot
聽* @since 2006-2-2
聽* @version 1.0
聽*/
public class ImprovedQuickSort implements SortUtil.Sort {
聽聽聽 private static int MAX_STACK_SIZE=4096;
聽聽聽 private static int THRESHOLD=10;
聽聽聽 /* (non-Javadoc)
聽聽聽聽 * @see org.rut.util.algorithm.SortUtil.Sort#sort(int[])
聽聽聽聽 */
聽聽聽 public void sort(int[] data) {
聽聽聽聽聽聽聽 int[] stack=new int[MAX_STACK_SIZE];
聽聽聽聽聽聽聽
聽聽聽聽聽聽聽 int top=-1;
聽聽聽聽聽聽聽 int pivot;
聽聽聽聽聽聽聽 int pivotIndex,l,r;
聽聽聽聽聽聽聽
聽聽聽聽聽聽聽 stack[++top]=0;
聽聽聽聽聽聽聽 stack[++top]=data.length-1;
聽聽聽聽聽聽聽
聽聽聽聽聽聽聽 while(top>0){
聽聽聽聽聽聽聽聽聽聽聽 int j=stack[top--];
聽聽聽聽聽聽聽聽聽聽聽 int i=stack[top--];
聽聽聽聽聽聽聽聽聽聽聽
聽聽聽聽聽聽聽聽聽聽聽 pivotIndex=(i+j)/2;
聽聽聽聽聽聽聽聽聽聽聽 pivot=data[pivotIndex];
聽聽聽聽聽聽聽聽聽聽聽
聽聽聽聽聽聽聽聽聽聽聽 SortUtil.swap(data,pivotIndex,j);
聽聽聽聽聽聽聽聽聽聽聽
聽聽聽聽聽聽聽聽聽聽聽 //partition
聽聽聽聽聽聽聽聽聽聽聽 l=i-1;
聽聽聽聽聽聽聽聽聽聽聽 r=j;
聽聽聽聽聽聽聽聽聽聽聽 do{
聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽 while(data[++l]<pivot);
聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽 while((r!=0)&&(data[--r]>pivot));
聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽 SortUtil.swap(data,l,r);
聽聽聽聽聽聽聽聽聽聽聽 }
聽聽聽聽聽聽聽聽聽聽聽 while(l<r);
聽聽聽聽聽聽聽聽聽聽聽 SortUtil.swap(data,l,r);
聽聽聽聽聽聽聽聽聽聽聽 SortUtil.swap(data,l,j);
聽聽聽聽聽聽聽聽聽聽聽
聽聽聽聽聽聽聽聽聽聽聽 if((l-i)>THRESHOLD){
聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽 stack[++top]=i;
聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽 stack[++top]=l-1;
聽聽聽聽聽聽聽聽聽聽聽 }
聽聽聽聽聽聽聽聽聽聽聽 if((j-l)>THRESHOLD){
聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽 stack[++top]=l+1;
聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽 stack[++top]=j;
聽聽聽聽聽聽聽聽聽聽聽 }
聽聽聽聽聽聽聽聽聽聽聽
聽聽聽聽聽聽聽 }
聽聽聽聽聽聽聽 //new InsertSort().sort(data);
聽聽聽聽聽聽聽 insertSort(data);
聽聽聽 }
聽聽聽 /**
聽聽聽聽 * @param data
聽聽聽聽 */
聽聽聽 private void insertSort(int[] data) {
聽聽聽聽聽聽聽 int temp;
聽聽聽聽聽聽聽 for(int i=1;i<data.length;i++){
聽聽聽聽聽聽聽聽聽聽聽 for(int j=i;(j>0)&&(data[j]<data[j-1]);j--){
聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽 SortUtil.swap(data,j,j-1);
聽聽聽聽聽聽聽聽聽聽聽 }
聽聽聽聽聽聽聽 }聽聽聽聽聽聽
聽聽聽 }
}
褰掑茍鎺掑簭:
package org.rut.util.algorithm.support;
import org.rut.util.algorithm.SortUtil;
/**
聽* @author treeroot
聽* @since 2006-2-2
聽* @version 1.0
聽*/
public class MergeSort implements SortUtil.Sort{
聽聽聽 /* (non-Javadoc)
聽聽聽聽 * @see org.rut.util.algorithm.SortUtil.Sort#sort(int[])
聽聽聽聽 */
聽聽聽 public void sort(int[] data) {
聽聽聽聽聽聽聽 int[] temp=new int[data.length];
聽聽聽聽聽聽聽 mergeSort(data,temp,0,data.length-1);
聽聽聽 }
聽聽聽
聽聽聽 private void mergeSort(int[] data,int[] temp,int l,int r){
聽聽聽聽聽聽聽 int mid=(l+r)/2;
聽聽聽聽聽聽聽 if(l==r) return ;
聽聽聽聽聽聽聽 mergeSort(data,temp,l,mid);
聽聽聽聽聽聽聽 mergeSort(data,temp,mid+1,r);
聽聽聽聽聽聽聽 for(int i=l;i<=r;i++){
聽聽聽聽聽聽聽聽聽聽聽 temp[i]=data[i];
聽聽聽聽聽聽聽 }
聽聽聽聽聽聽聽 int i1=l;
聽聽聽聽聽聽聽 int i2=mid+1;
聽聽聽聽聽聽聽 for(int cur=l;cur<=r;cur++){
聽聽聽聽聽聽聽聽聽聽聽 if(i1==mid+1)
聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽 data[cur]=temp[i2++];
聽聽聽聽聽聽聽聽聽聽聽 else if(i2>r)
聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽 data[cur]=temp[i1++];
聽聽聽聽聽聽聽聽聽聽聽 else if(temp[i1]<temp[i2])
聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽 data[cur]=temp[i1++];
聽聽聽聽聽聽聽聽聽聽聽 else
聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽 data[cur]=temp[i2++];聽聽聽聽聽聽聽聽聽聽聽
聽聽聽聽聽聽聽 }
聽聽聽 }
}
鏀硅繘鍚庣殑褰掑茍鎺掑簭:
package org.rut.util.algorithm.support;
import org.rut.util.algorithm.SortUtil;
/**
聽* @author treeroot
聽* @since 2006-2-2
聽* @version 1.0
聽*/
public class ImprovedMergeSort implements SortUtil.Sort {
聽聽聽 private static final int THRESHOLD = 10;
聽聽聽 /*
聽聽聽聽 * (non-Javadoc)
聽聽聽聽 *
聽聽聽聽 * @see org.rut.util.algorithm.SortUtil.Sort#sort(int[])
聽聽聽聽 */
聽聽聽 public void sort(int[] data) {
聽聽聽聽聽聽聽 int[] temp=new int[data.length];
聽聽聽聽聽聽聽 mergeSort(data,temp,0,data.length-1);
聽聽聽 }
聽聽聽 private void mergeSort(int[] data, int[] temp, int l, int r) {
聽聽聽聽聽聽聽 int i, j, k;
聽聽聽聽聽聽聽 int mid = (l + r) / 2;
聽聽聽聽聽聽聽 if (l == r)
聽聽聽聽聽聽聽聽聽聽聽 return;
聽聽聽聽聽聽聽 if ((mid - l) >= THRESHOLD)
聽聽聽聽聽聽聽聽聽聽聽 mergeSort(data, temp, l, mid);
聽聽聽聽聽聽聽 else
聽聽聽聽聽聽聽聽聽聽聽 insertSort(data, l, mid - l + 1);
聽聽聽聽聽聽聽 if ((r - mid) > THRESHOLD)
聽聽聽聽聽聽聽聽聽聽聽 mergeSort(data, temp, mid + 1, r);
聽聽聽聽聽聽聽 else
聽聽聽聽聽聽聽聽聽聽聽 insertSort(data, mid + 1, r - mid);
聽聽聽聽聽聽聽 for (i = l; i <= mid; i++) {
聽聽聽聽聽聽聽聽聽聽聽 temp[i] = data[i];
聽聽聽聽聽聽聽 }
聽聽聽聽聽聽聽 for (j = 1; j <= r - mid; j++) {
聽聽聽聽聽聽聽聽聽聽聽 temp[r - j + 1] = data[j + mid];
聽聽聽聽聽聽聽 }
聽聽聽聽聽聽聽 int a = temp[l];
聽聽聽聽聽聽聽 int b = temp[r];
聽聽聽聽聽聽聽 for (i = l, j = r, k = l; k <= r; k++) {
聽聽聽聽聽聽聽聽聽聽聽 if (a < b) {
聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽 data[k] = temp[i++];
聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽 a = temp[i];
聽聽聽聽聽聽聽聽聽聽聽 } else {
聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽 data[k] = temp[j--];
聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽 b = temp[j];
聽聽聽聽聽聽聽聽聽聽聽 }
聽聽聽聽聽聽聽 }
聽聽聽 }
聽聽聽 /**
聽聽聽聽 * @param data
聽聽聽聽 * @param l
聽聽聽聽 * @param i
聽聽聽聽 */
聽聽聽 private void insertSort(int[] data, int start, int len) {
聽聽聽聽聽聽聽 for(int i=start+1;i<start+len;i++){
聽聽聽聽聽聽聽聽聽聽聽 for(int j=i;(j>start) && data[j]<data[j-1];j--){
聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽 SortUtil.swap(data,j,j-1);
聽聽聽聽聽聽聽聽聽聽聽 }
聽聽聽聽聽聽聽 }
聽聽聽 }
}
鍫嗘帓搴?
package org.rut.util.algorithm.support;
import org.rut.util.algorithm.SortUtil;
/**
聽* @author treeroot
聽* @since 2006-2-2
聽* @version 1.0
聽*/
public class HeapSort implements SortUtil.Sort{
聽聽聽 /* (non-Javadoc)
聽聽聽聽 * @see org.rut.util.algorithm.SortUtil.Sort#sort(int[])
聽聽聽聽 */
聽聽聽 public void sort(int[] data) {
聽聽聽聽聽聽聽 MaxHeap h=new MaxHeap();
聽聽聽聽聽聽聽 h.init(data);
聽聽聽聽聽聽聽 for(int i=0;i<data.length;i++)
聽聽聽聽聽聽聽聽聽聽聽 h.remove();
聽聽聽聽聽聽聽 System.arraycopy(h.queue,1,data,0,data.length);
聽聽聽 }
聽聽聽聽 private static class MaxHeap{
聽聽聽聽聽聽聽聽
聽聽聽聽聽聽聽
聽聽聽聽聽聽聽 void init(int[] data){
聽聽聽聽聽聽聽聽聽聽聽 this.queue=new int[data.length+1];
聽聽聽聽聽聽聽聽聽聽聽 for(int i=0;i<data.length;i++){
聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽 queue[++size]=data[i];
聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽 fixUp(size);
聽聽聽聽聽聽聽聽聽聽聽 }
聽聽聽聽聽聽聽 }
聽聽聽聽聽聽聽聽
聽聽聽聽聽聽聽 private int size=0;
聽聽聽聽聽聽聽 private int[] queue;
聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽
聽聽聽聽聽聽聽 public int get() {
聽聽聽聽聽聽聽聽聽聽聽 return queue[1];
聽聽聽聽聽聽聽 }
聽聽聽聽聽聽聽 public void remove() {
聽聽聽聽聽聽聽聽聽聽聽 SortUtil.swap(queue,1,size--);
聽聽聽聽聽聽聽聽聽聽聽 fixDown(1);
聽聽聽聽聽聽聽 }
聽聽聽聽聽聽聽 //fixdown
聽聽聽聽聽聽聽 private void fixDown(int k) {
聽聽聽聽聽聽聽聽聽聽聽 int j;
聽聽聽聽聽聽聽聽聽聽聽 while ((j = k << 1) <= size) {
聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽 if (j < size && queue[j]<queue[j+1])
聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽 j++;
聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽 if (queue[k]>queue[j]) //涓嶇敤浜ゆ崲
聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽 break;
聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽 SortUtil.swap(queue,j,k);
聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽 k = j;
聽聽聽聽聽聽聽聽聽聽聽 }
聽聽聽聽聽聽聽 }
聽聽聽聽聽聽聽 private void fixUp(int k) {
聽聽聽聽聽聽聽聽聽聽聽 while (k > 1) {
聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽 int j = k >> 1;
聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽 if (queue[j]>queue[k])
聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽 break;
聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽 SortUtil.swap(queue,j,k);
聽聽聽聽聽聽聽聽聽聽聽聽聽聽聽 k = j;
聽聽聽聽聽聽聽聽聽聽聽 }
聽聽聽聽聽聽聽 }
聽聽聽 }
}
聽
SortUtil:
package org.rut.util.algorithm;
import org.rut.util.algorithm.support.BubbleSort;
import org.rut.util.algorithm.support.HeapSort;
import org.rut.util.algorithm.support.ImprovedMergeSort;
import org.rut.util.algorithm.support.ImprovedQuickSort;
import org.rut.util.algorithm.support.InsertSort;
import org.rut.util.algorithm.support.MergeSort;
import org.rut.util.algorithm.support.QuickSort;
import org.rut.util.algorithm.support.SelectionSort;
import org.rut.util.algorithm.support.ShellSort;
/**
聽* @author treeroot
聽* @since 2006-2-2
聽* @version 1.0
聽*/
public class SortUtil {
聽聽聽 public final static int INSERT = 1;
聽聽聽 public final static int BUBBLE = 2;
聽聽聽 public final static int SELECTION = 3;
聽聽聽 public final static int SHELL = 4;
聽聽聽 public final static int QUICK = 5;
聽聽聽 public final static int IMPROVED_QUICK = 6;
聽聽聽 public final static int MERGE = 7;
聽聽聽 public final static int IMPROVED_MERGE = 8;
聽聽聽 public final static int HEAP = 9;
聽聽聽 public static void sort(int[] data) {
聽聽聽聽聽聽聽 sort(data, IMPROVED_QUICK);
聽聽聽 }
聽聽聽 private static String[] name={
聽聽聽聽聽聽聽聽聽聽聽 "insert","bubble","selection","shell","quick","improved_quick","merge","improved_merge","heap"
聽聽聽 };
聽聽聽
聽聽聽 private static Sort[] impl=new Sort[]{
聽聽聽聽聽聽聽聽聽聽聽 new InsertSort(),
聽聽聽聽聽聽聽聽聽聽聽 new BubbleSort(),
聽聽聽聽聽聽聽聽聽聽聽 new SelectionSort(),
聽聽聽聽聽聽聽聽聽聽聽 new ShellSort(),
聽聽聽聽聽聽聽聽聽聽聽 new QuickSort(),
聽聽聽聽聽聽聽聽聽聽聽 new ImprovedQuickSort(),
聽聽聽聽聽聽聽聽聽聽聽 new MergeSort(),
聽聽聽聽聽聽聽聽聽聽聽 new ImprovedMergeSort(),
聽聽聽聽聽聽聽聽聽聽聽 new HeapSort()
聽聽聽 };
聽聽聽 public static String toString(int algorithm){
聽聽聽聽聽聽聽 return name[algorithm-1];
聽聽聽 }
聽聽聽
聽聽聽 public static void sort(int[] data, int algorithm) {
聽聽聽聽聽聽聽 impl[algorithm-1].sort(data);
聽聽聽 }
聽聽聽 public static interface Sort {
聽聽聽聽聽聽聽 public void sort(int[] data);
聽聽聽 }
聽聽聽 public static void swap(int[] data, int i, int j) {
聽聽聽聽聽聽聽 int temp = data[i];
聽聽聽聽聽聽聽 data[i] = data[j];
聽聽聽聽聽聽聽 data[j] = temp;
聽聽聽 }
}
]]>
鐢ㄦ潵浠ｆ浛澶嶉夋鍜屽崟閫夋寜閽殑鍙︿竴涓柟娉曟槸寤虹珛涓嬫媺寮忓垪琛ㄦ鏉ユ樉紺轟竴涓夋嫨鑿滃崟銆備笅鎷夊紡鍒楄〃妗嗕竴嬈″彧鑳芥樉紺轟竴涓夋嫨錛岃鏌ョ湅鍒殑鍙兘鐨勯夐」錛屼綘鍙互鐐瑰嚮妗嗗彸杈圭殑綆ご銆備嬌鐢ㄤ笅鎷夊紡鍒楄〃妗嗙殑涓涓ソ澶勬槸瀹冨拰鍗曢夋寜閽拰澶嶉夋鐩告瘮錛屽崰鐢ㄧ綉欏典笂杈冨皯鐨勭┖闂淬?/p>
浣犲彲浠ヤ嬌鐢?lt;SELECT>鍜?lt;OPTION>鏍囪瘑絎︽潵寤虹珛涓涓笅鎷夊紡鍒楄〃妗嗭紝璞′笅闈㈢殑渚嬪瓙錛?/p>
<HTML>
<HEAD>
<TITLE> Drop-Down List Box </TITLE>
</HEAD>
<BODY >
<FORM ACTION錛濃渟omedirectory/mypage.asp鈥?METHOD=鈥淧OST鈥?gt;
<BR> Please indicate your sex:
<BR> <SELECT NAME=鈥渟ex鈥?gt;
<OPTION VALUE=鈥淚s Male鈥?gt;Male
<OPTION VALUE=鈥淚s Female鈥?gt;Female
</SELECT>
<INPUT TYPE=SUBMIT VALUE=鈥淪ubmit Me!鈥?gt;
</FORM>
</BODY>
</HTML>
鍦ㄦ渚嬩腑錛?lt;SELECT>鐨凬AME灞炴т負浣犵殑涓嬫媺寮忓垪琛ㄦ鎻愪緵浜嗕竴涓悕瀛楋紝姣忎竴涓?lt;OPTION>鏍囪瘑絎︽彁渚涗簡涓涓彲鑳界殑閫夐」銆?lt;OPTION>鐨刅ALUE灞炴ф寚瀹氫簡褰撻夋嫨浜嗘欏瑰茍鎸変笅Submit鎸夐挳鍚庡簲璇ヨ鎻愪氦鐨勫箋傛渶鍚庯紝鍦?lt;OPTION>鏍囪瘑絎﹀悗鍑虹幇鐨勬枃瀛楀喅瀹氫簡榪欎竴欏瑰湪涓嬫媺寮忓垪琛ㄦ涓庢牱鏄劇ず鍑烘潵銆?/p>
姝や緥涓殑鍒楄〃妗嗕笌涓緇勫崟閫夋寜閽殑鍔熻兘涓鏍鳳紝浣犱竴嬈″彧鑳介夋嫨涓欏廣備緥濡傦紝濡傛灉浣犱粠鍒楄〃妗嗕腑閫夋嫨浜咶emale涓欏癸紝褰撴寜涓婼ubmit鎸夐挳鏃訛紝鍙戦佺殑鍊煎皢鏄疘s Female銆傝繖涓煎皢涓庡垪琛ㄦ鍚峴ex鐩稿叧鑱旓紝浣犳案榪滀篃涓嶄細涓嬈￠夋嫨澶氶」銆?/p>
緙虹渷鐘舵佷笅錛岃窡鍦ㄧ涓涓?lt;OPTION>鏍囪瘑絎﹀悗鐨勬枃瀛楀皢浼氭垚涓轟笅鎷夊紡鍒楄〃妗嗙殑鍒濆鍊艱屾樉紺猴紝浣犲彲浠ヤ嬌鐢?lt;OPTION>鐨凷ELECT灞炴ф潵鏀瑰彉榪欎竴緙虹渷鍊箋傚湪涓嬩緥涓紝褰撳垪琛ㄦ鍑虹幇鏃訛紝Female琚夋嫨浜嗭紝铏界劧鍦ㄩ夐」鍒楄〃涓璏ale鎺掑湪Female鐨勫墠闈€?/p>
<HTML>
<HEAD>
<TITLE> Drop-Down List Box </TITLE>
</HEAD>
<BODY >
<FORM ACTION錛濃渟omedirectory/mypage.asp鈥?METHOD=鈥淧OST鈥?gt;
<BR> Please indicate your sex:
<BR> <SELECT NAME=鈥渟ex鈥?gt;
<OPTION VALUE=鈥淚s Male鈥?gt;Male
<OPTION VALUE=鈥淚s Female鈥?SELECTED>Female
</SELECT>
<BR> <INPUT TYPE=SUBMIT VALUE=鈥淪ubmit Me!鈥?gt;
</FORM>
</BODY>
</HTML>
鎸囧畾涓涓笉鍚岀殑緙虹渷鍊煎湪鏌愮鎯呭喌涓嬫槸寰堟湁鐢ㄧ殑錛岄偅灝辨槸褰撲綘鏈変竴涓瓧姣嶉『搴忕殑鍒楄〃錛屼絾浣犳兂閫夋嫨鍒楄〃涓殑鏌愪竴涓綔涓哄畠鐨勭己鐪佸箋備緥濡傦紝鍋囪浣犳湁涓涓澶氬浘璞＄殑鍒楄〃錛屼絾浣犳兂璁╃己鐪佺殑鍥捐薄鏄腑鍥斤紝鍦ㄨ繖縐嶆儏鍐典笅錛屼綘鍙互浣跨敤SELECT灞炴ф潵鎸囧畾P.R.China涓虹己鐪佸鹼紝鍗充嬌榪欎釜鍥藉鐨勫悕瀛楁帓鍒楀湪鏁翠釜瀛楁瘝琛ㄧ殑鍚庡ご銆?/p>
]]>
澶у鍦↗SP鐨勫紑鍙戣繃紼嬩腑錛岀粡甯稿嚭鐜頒腑鏂囦貢鐮佺殑闂錛屽彲鑳戒竴鑷沖洶鎵扮潃鎮紝鎴戠幇鍦ㄦ妸鎴戝湪JSP寮鍙戜腑閬囧埌鐨勪腑鏂囦貢鐮佺殑闂鍙婅В鍐沖姙娉曞啓鍑烘潵渚涘ぇ瀹跺弬鑰冦?
涓銆丣SP欏甸潰鏄劇ず涔辯爜
涓嬮潰鐨勬樉紺洪〉闈?display.jsp)灝卞嚭鐜頒貢鐮侊細
<html>
<head>
<title>JSP鐨勪腑鏂囧鐞?lt;/title>
<meta http-equiv="Content-Type" content="text/html; charset=gb2312">
</head>
<body>
<%
out.print("JSP鐨勪腑鏂囧鐞?);
%>
</body>
</html>
瀵逛笉鍚岀殑WEB鏈嶅姟鍣ㄥ拰涓嶅悓鐨凧DK鐗堟湰錛屽鐞嗙粨鏋滃氨涓嶄竴鏍楓傚師鍥狅細鏈嶅姟鍣ㄤ嬌鐢ㄧ殑緙栫爜鏂瑰紡涓嶅悓鍜屾祻瑙堝櫒瀵逛笉鍚岀殑瀛楃鏄劇ず緇撴灉涓嶅悓鑰屽鑷寸殑銆傝В鍐沖姙娉曪細鍦↗SP欏甸潰涓寚瀹氱紪鐮佹柟寮?gb2312),鍗沖湪欏甸潰鐨勭涓琛屽姞涓婏細<%@ page contentType="text/html; charset=gb2312"%>錛屽氨鍙互娑堥櫎涔辯爜浜嗐傚畬鏁撮〉闈㈠涓嬶細
<%@ page contentType="text/html; charset=gb2312"%>
<html>
<head>
<title>JSP鐨勪腑鏂囧鐞?lt;/title>
<meta http-equiv="Content-Type" content="text/html; charset=gb2312">
</head>
<body>
<%
out.print("JSP鐨勪腑鏂囧鐞?);
%>
</body>
</html>
浜屻佽〃鍗曟彁浜や腑鏂囨椂鍑虹幇涔辯爜
涓嬮潰鏄竴涓彁浜ら〉闈?submit.jsp)錛屼唬鐮佸涓嬶細
<html>
<head>
<title>JSP鐨勪腑鏂囧鐞?lt;/title>
<meta http-equiv="Content-Type" content="text/html; charset=gb2312">
</head>
<body>
<form name="form1" method="post" action="process.jsp">
<div align="center">
<input type="text" name="name">
<input type="submit" name="Submit" value="Submit">
</div>
</form>
</body>
</html>
涓嬮潰鏄鐞嗛〉闈?process.jsp)浠ｇ爜錛?
<%@ page contentType="text/html; charset=gb2312"%>
<html>
<head>
<title>JSP鐨勪腑鏂囧鐞?lt;/title>
<meta http-equiv="Content-Type" content="text/html; charset=gb2312">
</head>
<body>
<%=request.getParameter("name")%>
</body>
</html>
濡傛灉submit.jsp鎻愪氦鑻辨枃瀛楃鑳芥紜樉紺猴紝濡傛灉鎻愪氦涓枃鏃跺氨浼氬嚭鐜頒貢鐮併傚師鍥狅細嫻忚鍣ㄩ粯璁や嬌鐢║TF-8緙栫爜鏂瑰紡鏉ュ彂閫佽姹傦紝鑰孶TF-8鍜孏B2312緙栫爜鏂瑰紡琛ㄧず瀛楃鏃朵笉涓鏍鳳紝榪欐牱灝卞嚭鐜頒簡涓嶈兘璇嗗埆瀛楃銆傝В鍐沖姙娉?閫氳繃request.seCharacterEncoding("gb2312")瀵硅姹傝繘琛岀粺涓緙栫爜錛屽氨瀹炵幇浜嗕腑鏂囩殑姝ｅ父鏄劇ず銆備慨鏀瑰悗鐨刾rocess.jsp浠ｇ爜濡備笅錛?
<%@ page contentType="text/html; charset=gb2312"%>
<%
request.seCharacterEncoding("gb2312");
%>
<html>
<head>
<title>JSP鐨勪腑鏂囧鐞?lt;/title>
<meta http-equiv="Content-Type" content="text/html; charset=gb2312">
</head>
<body>
<%=request.getParameter("name")%>
</body>
</html>
涓夈佹暟鎹簱榪炴帴鍑虹幇涔辯爜
鍙娑夊強涓枃鐨勫湴鏂瑰叏閮ㄦ槸涔辯爜錛岃В鍐沖姙娉曪細鍦ㄦ暟鎹簱鐨勬暟鎹簱URL涓姞涓妘seUnicode=true&characterEncoding=GBK灝監K浜嗐?
鍥涖佹暟鎹簱鐨勬樉紺轟貢鐮?
鍦╩ysql4.1.0涓?varchar綾誨瀷錛宼ext綾誨瀷灝變細鍑虹幇涓枃涔辯爜錛屽浜巚archar綾誨瀷鎶婂畠璁句負binary灞炴у氨鍙互瑙ｅ喅涓枃闂錛屽浜巘ext綾誨瀷灝辮鐢ㄤ竴涓紪鐮佽漿鎹㈢被鏉ュ鐞嗭紝瀹炵幇濡備笅錛?
public class Convert {
/** 鎶奍SO-8859-1鐮佽漿鎹㈡垚GB2312
*/
public static String ISOtoGB(String iso){
String gb;
try{
if(iso.equals("") || iso == null){
return "";
}
else{
iso = iso.trim();
gb = new String(iso.getBytes("ISO-8859-1"),"GB2312");
return gb;
}
}
catch(Exception e){
System.err.print("緙栫爜杞崲閿欒錛?+e.getMessage());
return "";
}
}
}
鎶婂畠緙栬瘧鎴恈lass錛屽氨鍙互璋冪敤Convert綾葷殑闈欐佹柟娉旾SOtoGB()鏉ヨ漿鎹㈢紪鐮併?
濡傛灉浣犺繕鏈変粈涔堜笉鎳備箣澶勶細鎴戠粰澶у鎺ㄨ崘涓涓ソ鐨凧SP-JAVA緗戠珯錛?
http://www.phy.hbnu.edu.cn/dsp/
Linux鍜孞ava鏄簰鑱旂綉鐨勫疇鍎?鏇存槸浜掕仈緗戞椂浠ｇ殑涓ゅご闆勫笀, Linux鐨勭綉緇滃畨鍏ㄦу拰寮鏀炬簮浠ｇ爜,Java鐨勫鉤鍙扮嫭绔嬫у拰瀹夊叏鏄撶敤鎬э紝姝ｅソ絎﹀悎Internet騫沖彴鐨勮姹傦紝Linux鍜孞ava鐪熸槸澶╃敓涓瀵歸賦楦傚弻鐙祫婧愮綉緇欎綘鎻愪緵浜嗘渶濂界殑Linux鍜孞ava瀛︿範璧勬簮錛?嬈㈣繋澶у澶氬璁塊棶騫跺浼狅細
http://www.phy.hbnu.edu.cn/dsp/
]]>
緲昏瘧鐨凱owerPoint璁茬ǹ鍙互鍦ㄦ涓嬭澆錛?BR>firstCRC
ftp://www.clinux.org/pub/brokendoor/xp/firstCRC-cn.zip
1銆傞潰鍚戝璞＄紪紼嬬殑鍥涗釜闃舵
- 鏍囪瘑瀵硅薄
- 璁捐鑽夋
- 鏋勯犲眰嬈?BR>- 瀹炵幇鏂規硶
鍏跺疄鐜伴毦搴︽槸鎸夌収鐢變笅鍒頒笂鐨勯『搴忛掑鐨?BR>
2.鏍囪瘑瀵硅薄綆浠?BR>- 鎸夌収鍚堜綔浠ｇ悊錛堝璞★級鐨勮涓鴻繘琛屾ā鍧椾及璁?BR>- 瀹氫箟鐗瑰畾瀵硅薄鐨勭被
- 鍦ㄧ被鐨勫熀紜涓婂垎閰嶈矗浠伙紙絎﹀悎闇姹傦級
3.涓涓璁℃柟娉?BR>- 鏍規嵁緇忛獙鍜屾櫤鎱у仛鍑哄喅瀹?BR>- 鐢ㄧ粨鏋勫寲鐨勮璁℃枃妗ｈ褰曞喅瀹?BR>- 鍏呭垎褰誨簳鐨勬祴璇曡璁?BR>- 鍦ㄥ疄鐜扮殑榪囩▼涓淮鎶ゅ拰閬靛驚璁捐
4.璁捐琛ㄨ堪(CRC)
- 鍒椾婦鎵鏈夌殑鏂扮被
- 瀹氫箟綾繪垚鍛樻媴璐熺殑璐ｄ換
- 閫氳繃鍒嗛厤鐨勮矗浠繪潵鎻忚堪鍚堜綔鍏崇郴
5.CRC鍗＄墖浠嬬粛(浣跨敤瀹炰緥 DrawingEditor)
絎竴姝ワ細浠庡凡鐭ョ殑寮濮?BR>- 涓涓浘鐢卞涓浘鐗囨瀯鎴?BR>- 鍥劇墖鍒嗘垚寰堝縐嶇被
絎簩姝ワ細鎺ㄦ祴鏀寔鑰?BR>- 涓涓嚎鍙兘榪炴帴鍒板叾浠栧浘鐗?BR>- 涓涓滄櫤鑳解濈偣瀹屾垚榪欎釜宸ヤ綔
絎笁姝ワ細榪涜鎯呮櫙嫻嬭瘯
- 鍥劇墖縐誨姩鐨勬椂鍊欎緷璧栦簬瀹氫綅鍣?BR>- 閫氳繃瀹氫綅鍣ㄦ敼鍙橀『搴?BR>絎洓姝ワ細灝濊瘯榪涜鍒嗙粍
- 涓涓鐞嗙被浼間竴涓伐鍏?BR>- 澶勭悊鍣ㄦ槸鍞竴鐨?BR>絎簲姝ワ細閲嶆柊鍒嗛厤璐ｄ換
- 閫夋嫨淇濇寔鍦ㄨ鍥劇被涓?BR>- 閫夋嫨涓嶄細鍜屽浘涓璧蜂繚瀛?BR>
絎叚姝ワ細涓轟簡娓呮櫚鍖栬岄噸鍐?BR>- 鍥劇墖鎺掑簭闈炲父閲嶈
__________________
闂ㄤ箣涓嶅瓨錛岄亾涔冨緱涔嬶紒
涓嬮┈楗悰閰掞紝闂悰浣曟墍涔嬨?BR>鍚涜█涓嶅緱鎰忥紝褰掑崸鍗楀北闄層?BR>浣嗗幓鑾闂紝鐧戒簯鏃犲敖鏃躲?BR>鈥斺斺斺?BR>* http://www.softme.org
* http://www.wfchina.org
* http://gro.clinux.org/projects/webpm/
]]>
涓昏鐨勫尯鍒涓嬶細
鏈夋棤鍐欏叆淇℃伅鎴栨洿鏂板唴瀛樼殑鑳藉姏銆傛潯褰㈢爜鐨勫唴瀛樹笉鑳芥洿鏀廣傚皠棰戞爣絳句笉鍍忔潯褰㈢爜錛屽畠鐗規湁鐨勮鯨璇嗗櫒涓嶈兘琚鍒躲傛爣絳劇殑浣滅敤涓嶄粎浠呭眬闄愪簬瑙嗛噹涔嬪唴錛屽洜涓轟俊鎭槸鐢辨棤綰跨數娉紶杈擄紝鑰屾潯褰㈢爜蹇呴』鍦ㄨ閲庝箣鍐呫?BR>
鐢靛瓙浜у搧浠ｇ爜騫朵笉浠呬粎鏄竴涓棤綰跨數娉㈡潯褰㈢爜錛屽畠鍖呭惈钁椾竴緋誨垪鐨勬暟鎹拰淇℃伅錛岃薄浜у湴錛屾棩鏈熶唬鐮佸拰鍏朵粬鍏抽敭鐨勪緵搴斾俊鎭紝榪欎簺淇℃伅鍌ㄥ瓨鍦ㄤ竴涓皬鐨勭鐗囦腑錛屽埄鐢ㄦ爣絳撅紝瑙ｈ鍣ㄥ拰璁＄畻鏈虹殑鑱旂綉錛岀敓浜ц呭拰闆跺敭鍟嗗氨鍙互闅忔椂浜嗚В綺劇‘鐨勪駭鍝佸拰搴撳瓨淇℃伅銆?BR>
]]>
]]>