/** * Sorts the specified range of the receiver into ascending order. * * The sorting algorithm is dynamically chosen according to the characteristics of the data set. * This default implementation simply calls quickSort. * Override this method if you can determine which sort is most appropriate for the given data set. * * @param from the index of the first element (inclusive) to be sorted. * @param to the index of the last element (inclusive) to be sorted. * @throws IndexOutOfBoundsException if <tt>(from<0 || from>to || to>=size()) && to!=from-1</tt>. */ public void sortFromTo(int from, int to) { quickSortFromTo(from, to); } /**
/** * Sorts the specified range of the receiver into ascending order. * * The sorting algorithm is dynamically chosen according to the characteristics of the data set. * This default implementation simply calls quickSort. * Override this method if you can determine which sort is most appropriate for the given data set. * * @param from the index of the first element (inclusive) to be sorted. * @param to the index of the last element (inclusive) to be sorted. * @throws IndexOutOfBoundsException if <tt>(from<0 || from>to || to>=size()) && to!=from-1</tt>. */ public void sortFromTo(int from, int to) { quickSortFromTo(from, to); } /**
/** * Sorts the specified range of the receiver into ascending order. * * The sorting algorithm is dynamically chosen according to the * characteristics of the data set. This default implementation simply calls * quickSort. Override this method if you can determine which sort is most * appropriate for the given data set. * * @param from * the index of the first element (inclusive) to be sorted. * @param to * the index of the last element (inclusive) to be sorted. * @throws IndexOutOfBoundsException * if * <tt>(from<0 || from>to || to>=size()) && to!=from-1</tt> * . */ public void sortFromTo(int from, int to) { quickSortFromTo(from, to); }
/** * Sorts the specified range of the receiver into ascending order. * * The sorting algorithm is dynamically chosen according to the * characteristics of the data set. This default implementation simply calls * quickSort. Override this method if you can determine which sort is most * appropriate for the given data set. * * @param from * the index of the first element (inclusive) to be sorted. * @param to * the index of the last element (inclusive) to be sorted. * @throws IndexOutOfBoundsException * if * <tt>(from<0 || from>to || to>=size()) && to!=from-1</tt> * . */ public void sortFromTo(int from, int to) { quickSortFromTo(from, to); }
/** * Sorts the specified range of the receiver into ascending order. * * The sorting algorithm is dynamically chosen according to the * characteristics of the data set. This default implementation simply calls * quickSort. Override this method if you can determine which sort is most * appropriate for the given data set. * * @param from * the index of the first element (inclusive) to be sorted. * @param to * the index of the last element (inclusive) to be sorted. * @throws IndexOutOfBoundsException * if * <tt>(from<0 || from>to || to>=size()) && to!=from-1</tt> * . */ public void sortFromTo(int from, int to) { quickSortFromTo(from, to); }
/** * Sorts the receiver into ascending order. The sorting algorithm is a tuned * quicksort, adapted from Jon L. Bentley and M. Douglas McIlroy's * "Engineering a Sort Function", Software-Practice and Experience, Vol. * 23(11) P. 1249-1265 (November 1993). This algorithm offers n*log(n) * performance on many data sets that cause other quicksorts to degrade to * quadratic performance. * * <p> * <b>You should never call this method unless you are sure that this * particular sorting algorithm is the right one for your data set.</b> It * is generally better to call <tt>sort()</tt> or <tt>sortFromTo(...)</tt> * instead, because those methods automatically choose the best sorting * algorithm. */ public final void quickSort() { quickSortFromTo(0, size() - 1); }
/** * Sorts the receiver into * ascending order. The sorting algorithm is a tuned quicksort, * adapted from Jon L. Bentley and M. Douglas McIlroy's "Engineering a * Sort Function", Software-Practice and Experience, Vol. 23(11) * P. 1249-1265 (November 1993). This algorithm offers n*log(n) * performance on many data sets that cause other quicksorts to degrade to * quadratic performance. * * <p><b>You should never call this method unless you are sure that this particular sorting algorithm is the right one for your data set.</b> * It is generally better to call <tt>sort()</tt> or <tt>sortFromTo(...)</tt> instead, because those methods automatically choose the best sorting algorithm. */ public final void quickSort() { quickSortFromTo(0, size()-1); } /**
/** * Sorts the receiver into * ascending order. The sorting algorithm is a tuned quicksort, * adapted from Jon L. Bentley and M. Douglas McIlroy's "Engineering a * Sort Function", Software-Practice and Experience, Vol. 23(11) * P. 1249-1265 (November 1993). This algorithm offers n*log(n) * performance on many data sets that cause other quicksorts to degrade to * quadratic performance. * * <p><b>You should never call this method unless you are sure that this particular sorting algorithm is the right one for your data set.</b> * It is generally better to call <tt>sort()</tt> or <tt>sortFromTo(...)</tt> instead, because those methods automatically choose the best sorting algorithm. */ public final void quickSort() { quickSortFromTo(0, size()-1); } /**
/** * Sorts the receiver into ascending order. The sorting algorithm is a tuned * quicksort, adapted from Jon L. Bentley and M. Douglas McIlroy's * "Engineering a Sort Function", Software-Practice and Experience, Vol. * 23(11) P. 1249-1265 (November 1993). This algorithm offers n*log(n) * performance on many data sets that cause other quicksorts to degrade to * quadratic performance. * * <p> * <b>You should never call this method unless you are sure that this * particular sorting algorithm is the right one for your data set.</b> It * is generally better to call <tt>sort()</tt> or <tt>sortFromTo(...)</tt> * instead, because those methods automatically choose the best sorting * algorithm. */ public final void quickSort() { quickSortFromTo(0, size() - 1); }
/** * Sorts the receiver into ascending order. The sorting algorithm is a tuned * quicksort, adapted from Jon L. Bentley and M. Douglas McIlroy's * "Engineering a Sort Function", Software-Practice and Experience, Vol. * 23(11) P. 1249-1265 (November 1993). This algorithm offers n*log(n) * performance on many data sets that cause other quicksorts to degrade to * quadratic performance. * * <p> * <b>You should never call this method unless you are sure that this * particular sorting algorithm is the right one for your data set.</b> It * is generally better to call <tt>sort()</tt> or <tt>sortFromTo(...)</tt> * instead, because those methods automatically choose the best sorting * algorithm. */ public final void quickSort() { quickSortFromTo(0, size() - 1); }