Description: The basis for subsequent sorting implementations
package org.lion.euler.study.sort; import java.util.List; import java.util.ListIterator; /** * Sort abstraction * @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; } }