Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- package de.Classes;
- public class QuickSort extends Array {
- private int n;
- public void sort05() {
- n = zahl.length;
- quicksort(0, n - 1);
- }
- private void quicksort(int lo, int hi) {
- int i = lo, j = hi;
- // VergleichsÂelement x
- int x = zahl[(lo + hi) / 2];
- // Aufteilung
- while (i <= j) {
- while (zahl[i] < x)
- i++;
- while (zahl[j] > x)
- j--;
- if (i <= j) {
- exchange(i, j);
- i++;
- j--;
- }
- }
- // Rekursion
- if (lo < j)
- quicksort(lo, j);
- if (i < hi)
- quicksort(i, hi);
- }
- private void exchange(int i, int j) {
- int t = zahl[i];
- zahl[i] = zahl[j];
- zahl[j] = t;
- }
- } // end class QuickSorter
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement