排序-JAVA实现【一】排序抽象

说明:后续排序实现的基础

package org.lion.euler.study.sort;

import java.util.List;
import java.util.ListIterator;

/**
 * 排序抽象
 * @author lion
 *
 */
public abstract class AbstractSort {

	public abstract void sort(Integer[] array);
	
	public void sort(List<Integer> list){
		Integer[] array = (Integer[])list.toArray();
		this.sort(array);
		
		ListIterator<Integer> listIterator = list.listIterator();
        for (Integer e : array) {
        	listIterator.next();
        	listIterator.set(e);
        }
	}
	
	protected void swap(Integer[] array, int i, int j){
		Integer temp = array[i];
		array[i] = array[j];
		array[j] = temp;
	}
	
}

猜你喜欢

转载自blog.csdn.net/jiangxuexuanshuang/article/details/80229236