FilesExpand file tree

 main

/

QuickSortExample.java

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

37 lines (33 loc) · 954 Bytes

 main

/

QuickSortExample.java

Top

File metadata and controls

• Code
• Blame

37 lines (33 loc) · 954 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

package ch17;

import java.util.Arrays;

public class QuickSortExample {

static int partition(int[] A, int lo, int hi) {

int pivot = A[hi];

int left = lo;

for (int right = lo; right < hi; right++) {

if (A[right] < pivot) {

int temp = A[left];

A[left] = A[right];

A[right] = temp;

left++;

}

}

int temp = A[left];

A[left] = A[hi];

A[hi] = temp;

return left;

}

static int[] Quicksort(int[] A, int lo, int hi) {

if (lo < hi) {

int pivot = partition(A, lo, hi);

Quicksort(A, lo, pivot - 1);

Quicksort(A, pivot + 1, hi);

}

return A;

}

public static void main(String[] args) {

int[] A = new int[]{38, 27, 43, 3, 9, 82, 10};

Quicksort(A, 0, A.length - 1);

System.out.println(Arrays.toString(A));

}

}